The following pages link to Filippo Mignosi (Q223815):
Displayed 50 items.
- Abelian powers and repetitions in Sturmian words (Q287434) (← links)
- Automata and forbidden words (Q293331) (← links)
- Linear-size suffix tries (Q294967) (← links)
- Simple real-time constant-space string matching (Q390869) (← links)
- Item:Q223815 (redirect page) (← links)
- Sturmian graphs and integer representations over numeration systems (Q412361) (← links)
- Dictionary-symbolwise flexible parsing (Q450551) (← links)
- Characteristic Sturmian words are extremal for the critical factorization theorem (Q714825) (← links)
- On the number of factors of Sturmian words (Q805261) (← links)
- From Nerode's congruence to suffix automata with mismatches (Q840766) (← links)
- On Sturmian graphs (Q881581) (← links)
- Periodicities on trees (Q1275075) (← links)
- Periodicity and the golden ratio (Q1275466) (← links)
- Fine and Wilf's theorem for three periods and a generalization of Sturmian words (Q1292483) (← links)
- Sturmian morphisms and Rauzy's rules (Q1320513) (← links)
- Some combinatorial properties of Sturmian words (Q1349698) (← links)
- Periodicity, morphisms, and matrices. (Q1401234) (← links)
- Forbidden words in symbolic dynamics (Q1585506) (← links)
- Words and forbidden factors (Q1605329) (← links)
- On optimal parsing for LZ78-like compressors (Q1698700) (← links)
- Infinite words with linear subword complexity (Q1824405) (← links)
- On Fine and Wilf's theorem for bidimensional words. (Q1853743) (← links)
- On a conjecture on bidimensional words. (Q1874389) (← links)
- Entropy and compression: a simple proof of an inequality of Khinchin-Ornstein-Shields (Q2190980) (← links)
- Abelian-square-rich words (Q2358695) (← links)
- Automated synthesis of application-layer connectors from automata-based specifications (Q2424673) (← links)
- Note on the greedy parsing optimality for dictionary-based text compression (Q2437746) (← links)
- Languages with mismatches (Q2456367) (← links)
- Word assembly through minimal forbidden words (Q2503298) (← links)
- A multidimensional critical factorization theorem (Q2581347) (← links)
- On the number of Arnoux–Rauzy words (Q2773325) (← links)
- Automated Synthesis of Application-Layer Connectors from Automata-Based Specifications (Q2799159) (← links)
- Compressing Big Data: When the Rate of Convergence to the Entropy Matters (Q2807846) (← links)
- A NEW COMPLEXITY FUNCTION FOR WORDS BASED ON PERIODICITY (Q2842028) (← links)
- The longest common substring problem (Q2971067) (← links)
- Dictionary-Symbolwise Flexible Parsing (Q3000525) (← links)
- Simple Real-Time Constant-Space String Matching (Q3011852) (← links)
- On Lazy Representations and Sturmian Graphs (Q3073629) (← links)
- Forbidden Factors and Fragment Assembly (Q3147023) (← links)
- Words with the Maximum Number of Abelian Squares (Q3449363) (← links)
- On the Suffix Automaton with Mismatches (Q3503902) (← links)
- A periodicity theorem on words and applications (Q3569024) (← links)
- STURMIAN WORDS AND AMBIGUOUS CONTEXT-FREE LANGUAGES (Q3978456) (← links)
- Repetitions in the Fibonacci infinite word (Q4012668) (← links)
- (Q4218144) (← links)
- (Q4227127) (← links)
- The expressibility of languages and relations by word equations (Q4406307) (← links)
- (Q4432976) (← links)
- (Q4437504) (← links)
- (Q4453438) (← links)