Computing forbidden words of regular languages

Fundamenta Informaticae

Volumn 56, Issue 1-2, 2003, Pages 121-135

  Béal, Marie Pierre ^a   Crochemore, Maxime ^a   Mignosi, Filippo ^b   Restivo, Antonio ^b   Sciortino, Marinella ^b  

^a Université de Marne la Vallée   (France)

^b UNIVERSITY OF PALERMO   (Italy)

Author keywords

Anti factorial language; Factor automaton; Factorial language; Failure function; Forbidden word; Formal languages; Sofic shift; Symbolic dynamics

Indexed keywords

ALGORITHMS; COMPUTATIONAL METHODS; POLYNOMIALS; PROBLEM SOLVING; THEOREM PROVING;

FORBIDDEN WORDS;

FORMAL LANGUAGES;

EID: 17544398649     PISSN: 01692968     EISSN: None     Source Type: Journal    
DOI: None     Document Type: Article

References (15)

1. Béal, M.-P., Mignosi, F., Restivo, A., Sciortino, M.: Forbidden words in symbolic dynamics, Adv. in Appl. Math., 25(2), 2000, 163-193.
2. Béal, M.-P., Senellart, J.: On the bound of the synchronization delay of a local automaton, Theoret. Comput. Sci., (205), 1998, 297-306.
3. Blumer, A., Blumer, J., Haussler, D., McConnell, R., Ehrenfeucht, A.: Complete Inverted Files for Efficient Text Retrieval and Analysis, Journal of the ACM, 34(3), 1987, 578-595.
4. Carpi, A., de Luca, A., Varricchio, S.: Words, univalent factors and boxes, Acta Informatica, 38(6), 2002, 409-436.
5. Černý, J.: Poznámka k. homogénnym experimentom s konečnými automatmi, Mat. fyz. čas., SAV 14, 1964, 208-215.
6. Crochemore, M., Hancart, C., Lecroq, Th.: Algorithmique du Texte, Vuibert, Paris, 2001.
7. Crochemore, M., Mignosi, F., Restivo, A.: Automata and forbidden words, Inform. Process. Lett., 67, 1998, 111-117.
8. Crochemore, M., Mignosi, F., Restivo, A., Salemi, S.: Data compression using antidictionaries, in: Proceedings of the IEEE, Lossless Data Compression (J. Storer, Ed.), 2000, 1756-1768.
9. Davenport, J. H.: Computer algebra for cylindrical algebraic decomposition, 1985, TRITA-NA-8511, NADA, KTH, Stockholm.
10. Davenport, J. H., Siret, Y., Tournier, E.: Computer Algebra, Second edition, Academic Press Ltd., London, 1993, Systems and algorithms for algebraic computation, With a preface by Daniel Lazard, Translated from the French by A. Davenport and J. H. Davenport, With a foreword by Anthony C. Hearn.
11. Hopcroft, J. E., Montwani, R., Ullman, J. D.: Introduction to Automata Theory, Languages and Computation, second edition, Addison-Wesley, 2001.
12. Lind, D., Marcus, B.: An Introduction to Symbolic Dynamics and Coding, Cambridge University Press, Cambridge, 1995.
13. Mignosi, F., Restivo, A., Sciortino, M.: Forbidden factors in finite and infinite words, in: Jewels are Forever, Springer, Berlin, 1999, 339-350.
14. Mignosi, F., Restivo, A., Sciortino, M.: Forbidden Factors and Fragment Assembly, RAIRO Theoret. Inform. Appl., 35(6), 2001, 565-577, (Journal version).
15. Raffinot, M.: Structures pour la localisation de motifs, Ph.D. Thesis, University of Marne-la-vallée, France, 1999.