The following pages link to Jean Berstel (Q213070):
Displaying 50 items.
- Splicing systems and the Chomsky hierarchy (Q428896) (← links)
- Recent results on syntactic groups of prefix codes. (Q444391) (← links)
- Local languages and the Berry-Sethi algorithm (Q672153) (← links)
- The expressive power of the shuffle product (Q710739) (← links)
- The origins of combinatorics on words (Q872058) (← links)
- Extension of Brzozowski's derivation calculus of rational expressions to series over the free partially commutative monoids (Q930924) (← links)
- Sturmian trees (Q968266) (← links)
- On the groups of codes with empty kernel. (Q982209) (← links)
- Every iterated morphism yields a co-CFL (Q1069710) (← links)
- On the length of word chains (Q1108812) (← links)
- Thue-Morse sequence and p-adic topology for the free monoid (Q1121888) (← links)
- Sur le théorème du defaut (Q1132974) (← links)
- Mots sans carre et morphismes iterés (Q1144665) (← links)
- (Q1164439) (redirect page) (← links)
- Recognizable formal power series on trees (Q1164440) (← links)
- Sur une conjecture de S. Greibach (Q1216963) (← links)
- Partial words and a theorem of Fine and Wilf (Q1292487) (← links)
- A characterization of overlap-free morphisms (Q1308744) (← links)
- Sturmian morphisms (Q1326951) (← links)
- Average cost of Duval's algorithm for generating Lyndon words (Q1334678) (← links)
- Efficient computation of addition chains (Q1340674) (← links)
- The set of minimal words of a context-free language is context-free (Q1384533) (← links)
- Sturmian words, Lyndon words and trees (Q1391533) (← links)
- Formal properties of XML grammars and languages (Q1403325) (← links)
- Coding rotations on intervals (Q1603687) (← links)
- Shuffle factorization is unique (Q1605326) (← links)
- Mixed languages (Q1770385) (← links)
- A relative of the Thue-Morse sequence (Q1894002) (← links)
- Random generation of finite Sturmian words (Q1917511) (← links)
- Bifix codes and Sturmian words (Q1946105) (← links)
- Minimisation of automata (Q2074212) (← links)
- Symbolic dynamics (Q2244822) (← links)
- Continuant polynomials and worst-case behavior of Hopcroft's minimization algorithm (Q2271419) (← links)
- Operations preserving regular languages (Q2368978) (← links)
- Another proof of Soittola's theorem (Q2481964) (← links)
- Growth of repetition-free words -- a review (Q2484440) (← links)
- (Q2959876) (← links)
- (Q3056218) (← links)
- (Q3062121) (← links)
- An Exercise on Fibonacci Representations (Q3147016) (← links)
- (Q3330542) (← links)
- (Q3395963) (← links)
- Sturmian and Episturmian Words (Q3522857) (← links)
- Combinatorics on Words (Q3549476) (← links)
- A First Investigation of Sturmian Trees (Q3590924) (← links)
- (Q3653240) (← links)
- (Q3673137) (← links)
- (Q3677189) (← links)
- (Q3691074) (← links)
- (Q3704906) (← links)
