The following pages link to Dominique Perrin (Q213071):
Displaying 50 items.
- A note on Sturmian words (Q418801) (← links)
- Recent results on syntactic groups of prefix codes. (Q444391) (← links)
- Corrigendum to ``On the theorem of Fredricksen and Maiorana about de Bruijn sequences'' (Q472929) (← links)
- Embeddings of local automata (Q716395) (← links)
- Neutral and tree sets of arbitrary characteristic (Q728278) (← links)
- Completing codes in a sofic shift (Q732037) (← links)
- Synchronization and simplification (Q755320) (← links)
- Completing biprefix codes (Q790624) (← links)
- Sur les monoides à un relateur qui sont des groupes (Q801040) (← links)
- The origins of combinatorics on words (Q872058) (← links)
- Unambiguous automata (Q942992) (← links)
- On the groups of codes with empty kernel. (Q982209) (← links)
- (Q1061500) (redirect page) (← links)
- Codeterministic automata on infinite words (Q1061501) (← links)
- First-order logic and star-free sets (Q1088982) (← links)
- Rational probability measures (Q1118896) (← links)
- Le degré minimal du groupe d'un code biprefixe fini (Q1132193) (← links)
- Sur le théorème du defaut (Q1132974) (← links)
- La représentation ergodique d'un automate fini (Q1133897) (← links)
- A conjecture on sets of differences of integer pairs (Q1156142) (← links)
- A graph covering construction of all the finite complete biprefix codes (Q1156495) (← links)
- La transitivite du groupe d'un code biprefixe fini (Q1230603) (← links)
- Maximal bifix codes (Q1292485) (← links)
- Marcel-Paul Schützenberger (1920--1996) (Q1365566) (← links)
- Groups, languages and dendric shifts (Q1622944) (← links)
- A note on the Burrows-Wheeler transformation (Q1770410) (← links)
- On syntactic groups. (Q1781927) (← links)
- A weak equivalence between shifts of finite type (Q1865259) (← links)
- Bifix codes and Sturmian words (Q1946105) (← links)
- Codes and noncommutative stochastic matrices (Q1959746) (← links)
- Enumerative sequences of leaves and nodes in rational trees (Q1960518) (← links)
- On the group of a rational maximal bifix code (Q2178790) (← links)
- Graded alphabets, circular codes, free Lie algebras and comma-free codes (Q2219960) (← links)
- Symbolic dynamics (Q2244822) (← links)
- The finite index basis property (Q2259171) (← links)
- Bifix codes and interval exchanges (Q2259187) (← links)
- Eventually dendric shifts (Q2330554) (← links)
- Return words and bifix codes in eventually dendric sets (Q2333039) (← links)
- Obituary: Aldo de Luca 1941--2018 (Q2334412) (← links)
- Acyclic, connected and tree sets (Q2339363) (← links)
- Specular sets (Q2358694) (← links)
- On the expressive power of temporal logic (Q2366686) (← links)
- Gérard Lallement (1935-2006) (Q2391164) (← links)
- Hall sets, Lazard sets and comma-free codes (Q2411623) (← links)
- A quadratic algorithm for road coloring (Q2449052) (← links)
- Codes and sofic constraints (Q2484447) (← links)
- Parsing with a finite dictionary (Q2484450) (← links)
- Codes, unambiguous automata and sofic systems. (Q2490804) (← links)
- Maximal bifix decoding (Q2514159) (← links)
- Congruences et automorphismes des automates finis (Q2544412) (← links)
