The following pages link to Antonio Restivo (Q405565):
Displayed 50 items.
- Item:Q405565 (redirect page) (← links)
- Automata and forbidden words (Q293331) (← links)
- Suffix array and Lyndon factorization of a text (Q405567) (← links)
- A note on Sturmian words (Q418801) (← links)
- A graph theoretic approach to automata minimality (Q418805) (← links)
- Extremal minimality conditions on automata (Q441884) (← links)
- Nondeterministic Moore automata and Brzozowski's minimization algorithm (Q442154) (← links)
- A bijection between words and multisets of necklaces (Q444410) (← links)
- Dictionary-symbolwise flexible parsing (Q450551) (← links)
- On the decomposition of prefix codes (Q517038) (← links)
- Balancing and clustering of words in the Burrows-Wheeler transform (Q544888) (← links)
- The expressive power of the shuffle product (Q710739) (← links)
- Characteristic Sturmian words are extremal for the critical factorization theorem (Q714825) (← links)
- Circular Sturmian words and Hopcroft's algorithm (Q732029) (← links)
- Synchronization and simplification (Q755320) (← links)
- On the Burnside problem for semigroups (Q797705) (← links)
- Reducing local alphabet size in recognizable picture languages (Q832926) (← links)
- Codes and local constraints (Q908715) (← links)
- Burrows-Wheeler transform and Sturmian words (Q1007612) (← links)
- On the centers of a language (Q1054162) (← links)
- On cancellation properties of languages which are supports of rational power series (Q1066677) (← links)
- Rational languages and the Burnside problem (Q1079380) (← links)
- Star-free sets of integers (Q1079381) (← links)
- Permutation properties and the Fibonacci semigroup (Q1114022) (← links)
- Sur le théorème du defaut (Q1132974) (← links)
- On some properties of very pure codes (Q1133332) (← links)
- Minimal complete sets of words (Q1145771) (← links)
- A family of codes commutatively equivalent to prefix codes (Q1155582) (← links)
- A synchronization property of pure subsemigroups of a free semigroup (Q1165591) (← links)
- A note on renewal systems (Q1190482) (← links)
- Star-free trace languages (Q1193878) (← links)
- On codes having no finite completions (Q1239130) (← links)
- A combinatorial property of codes having finite synchronization delay (Q1247946) (← links)
- Finitely generated sofic systems (Q1263995) (← links)
- Periodicities on trees (Q1275075) (← links)
- Periodicity and the golden ratio (Q1275466) (← links)
- On some factorization problems (Q1280223) (← links)
- Fine and Wilf's theorem for three periods and a generalization of Sturmian words (Q1292483) (← links)
- Forbidden words in symbolic dynamics (Q1585506) (← links)
- Words and forbidden factors (Q1605329) (← links)
- Block sorting-based transformations on words: beyond the magic BWT (Q1622940) (← links)
- Measuring the clustering effect of BWT via RLE (Q1676309) (← links)
- Burrows-Wheeler transform and run-length enconding (Q1678356) (← links)
- Anti-powers in infinite words (Q1747764) (← links)
- Patterns in words and languages (Q1765231) (← links)
- On the lattice of prefix codes. (Q1853555) (← links)
- On Fine and Wilf's theorem for bidimensional words. (Q1853743) (← links)
- Periodicity vectors for labelled trees (Q1861576) (← links)
- Monadic second-order logic over rectangular pictures and recognizability by tiling systems (Q1917078) (← links)
- On extremal cases of Hopcroft's algorithm (Q1959649) (← links)