Automata and forbidden words

Information Processing Letters

Volumn 67, Issue 3, 1998, Pages 111-117

  Crochemore, M ^a   Mignosi, F ^b   Restivo, A ^b  

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

^b UNIVERSITY OF PALERMO   (Italy)

Author keywords

Anti factorial language; Avoiding a word; Factor automaton; Factor code; Factorial language; Failure function; Forbidden word; Formal languages

Indexed keywords

EID: 0000672540     PISSN: 00200190     EISSN: None     Source Type: Journal    
DOI: 10.1016/s0020-0190(98)00104-5     Document Type: Article

References (9)

1. A.V. Aho, M.J. Corasick, Efficient string matching: an aid to bibliographic search, Comm. ACM 18 (6) (1975) 333-340.
2. M.-P. Béal, F. Mignosi, A. Restivo, Minimal Forbidden Words and Symbolic Dynamics, in: C. Puech and R. Reischuk (Eds.), STACS'96, Lecture Notes in Comput. Sci., Vol. 1046, Springer, Berlin, 1996, pp. 555-566.
3. J. Cassaigne, Complexité et Facteurs Spéciaux, Bull. Belg. Math. Soc. 4 (1997) 67-88.
4. M. Crochemore, C. Hancart, Automata for matching patterns, in: G. Rozenberg, A. Salomaa (Eds.), Handbook of Formal Languages, Linear Modeling: Background and Application, Vol. 2, Springer, Berlin, Chapter 9, pp. 399-462.
5. V. Dickert, Y. Kobayashi, Some identities related to automata, determinants, and Möbius functions, Report 1997/05, Fakultät Informatik, Universität Stuttgart, 1997.
6. A. de Luca, F. Mignosi, Some combinatorial properties of sturmian words, Theoret. Comput. Sci. 136 (1994) 361-385.
7. A. de Luca, L. Mione, On bispecial factors of the Thue-Morse word, Inform. Process. Lett. 49 (1994) 179-183.
8. R. McNaughton, S. Papert, Counter-Free Automata, MIT Press, Cambridge, MA, 1970.
9. D. Perrin, Symbolic dynamics and finite automata, Invited lecture in: Proc. MFCS'95, Lecture Notes in Comput. Sci., Vol. 969, Springer, Berlin, 1995.