filippo mignosi
filippo mignosi
Università degli Studi dell'Aquila, Italia
Email verificata su mail.univaq.it
Titolo
Citata da
Citata da
Anno
Chapter 7: "Periodicity"
F Mignosi, A Restivo
Algebraic combinatorics on words 90, 2002
2144*2002
Some combinatorial properties of Sturmian words
A de Luca, F Mignosi
Theoretical Computer Science 136 (2), 361-385, 1994
1951994
Automata and forbidden words
M Crochemore, F Mignosi, A Restivo
Information Processing Letters 67 (3), 111-117, 1998
1581998
On the number of factors of Sturmian words
F Mignosi
Theoretical Computer Science 82 (1), 71-84, 1991
1471991
Repetitions in the Fibonacci infinite word
F Mignosi, G Pirillo
RAIRO-Theoretical Informatics and Applications 26 (3), 199-204, 1992
1361992
Data compression using antidictionaries
M Crochemore, F Mignosi, A Restivo, S Salemi
Proceedings of the IEEE 88 (11), 1756-1768, 2000
1112000
Morphismes sturmiens et regles de Rauzy
F Mignosi, P Séébold
Journal de théorie des nombres de Bordeaux 5 (2), 221-233, 1993
1011993
The expressibility of languages and relations by word equations
J Karhumäki, F Mignosi, W Plandowski
Journal of the ACM (JACM) 47 (3), 483-505, 2000
952000
Garden of Eden configurations for cellular automata on Cayley graphs of groups
A Machì, F Mignosi
SIAM journal on discrete mathematics 6 (1), 44-56, 1993
911993
Infinite words with linear subword complexity
F Mignosi
Theoretical computer science 65 (2), 221-242, 1989
871989
Fine and Wilf's theorem for three periods and a generalization of Sturmian words
MG Castelli, F Mignosi, A Restivo
Theoretical Computer Science 218 (1), 83-94, 1999
741999
On a conjecture on bidimensional words
C Epifanio, M Koskas, F Mignosi
Theoretical computer science 299 (1-3), 123-150, 2003
632003
Words and forbidden factors
F Mignosi, A Restivo, M Sciortino
Theoretical Computer Science 273 (1-2), 99-117, 2002
602002
Text compression using antidictionaries
M Crochemore, F Mignosi, A Restivo, S Salemi
International Colloquium on Automata, Languages, and Programming, 261-270, 1999
601999
If a DOL language is k-power free then it is circular
F Mignosi, P Séébold
International Colloquium on Automata, Languages, and Programming, 507-518, 1993
561993
Minimal forbidden words and symbolic dynamics
MP Béal, F Mignosi, A Restivo
Annual Symposium on Theoretical Aspects of Computer Science, 555-566, 1996
501996
Word assembly through minimal forbidden words
G Fici, F Mignosi, A Restivo, M Sciortino
Theoretical Computer Science 359 (1-3), 214-230, 2006
432006
Forbidden words in symbolic dynamics
MP Béal, F Mignosi, A Restivo, M Sciortino
Advances in Applied Mathematics 25 (2), 163-193, 2000
392000
Periodicity and the golden ratio
F Mignosi, A Restivo, S Salemi
Theoretical computer science 204 (1-2), 153-167, 1998
381998
Computing forbidden words of regular languages
MP Béal, M Crochemore, F Mignosi, A Restivo, M Sciortino
Fundamenta Informaticae 56 (1-2), 121-135, 2003
372003
Il sistema al momento non può eseguire l'operazione. Riprova più tardi.
Articoli 1–20