An introduction to symbolic dynamics and coding
An introduction to symbolic dynamics and coding
The art of computer programming, volume 1 (3rd ed.): fundamental algorithms
The art of computer programming, volume 1 (3rd ed.): fundamental algorithms
The art of computer programming, volume 2 (3rd ed.): seminumerical algorithms
The art of computer programming, volume 2 (3rd ed.): seminumerical algorithms
Regular Article: A New Proof of the Gauss Interlace Conjecture
Advances in Applied Mathematics - Special issue dedicated to Henry Crapo
Discrete Mathematics
Finiteness and Regularity in Semigroups and Formal Languages
Finiteness and Regularity in Semigroups and Formal Languages
Word Processing in Groups
Shift Register Sequences
Applied Combinatorics on Words (Encyclopedia of Mathematics and its Applications)
Applied Combinatorics on Words (Encyclopedia of Mathematics and its Applications)
Formal languages and their relation to automata
Formal languages and their relation to automata
The Art of Computer Programming, Volume 4, Fascicle 2: Generating All Tuples and Permutations (Art of Computer Programming)
Classification of noncounting events
Journal of Computer and System Sciences
Subword balance, position indices and power sums
Journal of Computer and System Sciences
An extension of Christoffel duality to a subset of Sturm numbers and their characteristic words
Theoretical Computer Science
On extending de Bruijn sequences
Information Processing Letters
Solving word problems in group extensions over infinite words
DLT'11 Proceedings of the 15th international conference on Developments in language theory
DLT'11 Proceedings of the 15th international conference on Developments in language theory
The coolest order of binary strings
FUN'12 Proceedings of the 6th international conference on Fun with Algorithms
Online version of the theorem of Thue
Information Processing Letters
| Hi-index | 0.00 |
We investigate the historical roots of the field of combinatorics on words. They comprise applications and interpretations in algebra, geometry and combinatorial enumeration. These considerations gave rise to early results such as those of Axel Thue at the beginning of the 20th century. Other early results were obtained as a by-product of investigations on various combinatorial objects. For example, paths in graphs are encoded by words in a natural way, and conversely, the Cayley graph of a group or a semigroup encodes words by paths. We give in this text an account of this two-sided interaction.