Formal languages, automata and numeration systems 1 : introduction to combinatorics on words / Michel Rigo.

Format:

Book

Author/Creator:

Rigo, Michel, author.

Contributor:

Rigo, Michel, Contributor.

Series:

Networks and Telecommunications Series

Language:

English

Subjects (All):

Machine theory.

Formal languages.

Computer programming.

Computational linguistics.

Computer programming--Congresses.

Formal languages--Congresses.

Machine theory--Congresses.

Local Subjects:

Computer programming--Congresses.

Formal languages--Congresses.

Machine theory--Congresses.

Physical Description:

1 online resource (338 p.)

Edition:

1st ed.

Place of Publication:

Hoboken : John Wiley & Sons, Inc., 2014.

Language Note:

English

Summary:

Formal Languages, Automaton and Numeration Systems presents readers with a review of research related to formal language theory, combinatorics on words or numeration systems, such as Words, DLT (Developments in Language Theory), ICALP, MFCS (Mathematical Foundation of Computer Science), Mons Theoretical Computer Science Days, Numeration, CANT (Combinatorics, Automata and Number Theory).Combinatorics on words deals with problems that can be stated in a non-commutative monoid, such as subword complexity of finite or infinite words, construction and properties of infinite words, unavoidable regul

Contents:

Cover page; Half-Title page; Title page; Copyright page; Contents; Foreword; Introduction; I.1. What this book is or is not about; I.2. A few words about what you will find; I.3. How to read this book; I.4. Acknowledgments; 1: Words and Sequences from Scratch; 1.1. Mathematical background and notation; 1.1.1. About asymptotics; 1.1.2. Algebraic number theory; 1.2. Structures, words and languages; 1.2.1. Distance and topology; 1.2.2. Formal series; 1.2.3. Language, factor and frequency; 1.2.4. Period and factor complexity; 1.3. Examples of infinite words; 1.3.1. About cellular automata

1.3.2. Links with symbolic dynamical systems1.3.3. Shift and orbit closure; 1.3.4. First encounter with β-expansions; 1.3.5. Continued fractions; 1.3.6. Direct product, block coding and exercises; 1.4. Bibliographic notes and comments; 2: Morphic Words; 2.1. Formal definitions; 2.2. Parikh vectors and matrices associated with a morphism; 2.2.1. The matrix associated with a morphism; 2.2.2. The tribonacci word; 2.3. Constant-length morphisms; 2.3.1. Closure properties; 2.3.2. Kernel of a sequence; 2.3.3. Connections with cellular automata; 2.4. Primitive morphisms; 2.4.1. Asymptotic behavior

2.4.2. Frequencies and occurrences of factors2.5. Arbitrary morphisms; 2.5.1. Irreducible matrices; 2.5.2. Cyclic structure of irreducible matrices; 2.5.3. Proof of theorem 2.35; 2.6. Factor complexity and Sturmian words; 2.7. Exercises; 2.8. Bibliographic notes and comments; 3: More Material on Infinite Words; 3.1. Getting rid of erasing morphisms; 3.2. Recurrence; 3.3. More examples of infinite words; 3.4. Factor Graphs and special factors; 3.4.1. de Bruijn graphs; 3.4.2. Rauzy graphs; 3.5. From the Thue-Morse word to pattern avoidance; 3.6. Other combinatorial complexity measures

3.6.1. Abelian complexity3.6.2. k-Abelian complexity; 3.6.3. k-Binomial complexity; 3.6.4. Arithmetical complexity; 3.6.5. Pattern complexity; 3.7. Bibliographic notes and comments; Bibliography; Index; Volume 2 - Contents; Volume 2 - Index

Notes:

Description based upon print version of record.

Contains:

Introduction to combinatorics on words.

Applications to recognizability and decidability.

ISBN:

9781119008224

1119008220

9781119008200

1119008204

9781119008217

1119008212

OCLC:

890981770