论文信息 - Minimal Forbidden Words and Factor Automata

Minimal Forbidden Words and Factor Automata

Let L(M) be the (factorial) language avoiding a given anti-factorial language M. We design an automaton accepting L(M) and built from the language M. The construction is effective if M is finite.

Antonio Restivo | Filippo Mignosi | Maxime Crochemore

[1] Alfred V. Aho,et al. Efficient string matching , 1975, Commun. ACM.

[2] Dominique Perrin,et al. Symbolic Dynamics and Finite Automata , 1997, Handbook of Formal Languages.

[3] Julien Cassaigne,et al. Complexité et facteurs spéciaux , 1997 .

[4] Maxime Crochemore,et al. Automata for Matching Patterns , 1997, Handbook of Formal Languages.

[5] Robert McNaughton,et al. Counter-Free Automata (M.I.T. research monograph no. 65) , 1971 .

[6] Filippo Mignosi,et al. Some Combinatorial Properties of Sturmian Words , 1994, Theor. Comput. Sci..

[7] Antonio Restivo,et al. Minimal Forbidden Words and Symbolic Dynamics , 1996, STACS.

[8] Aldo de Luca,et al. On Bispecial Factors of the Thue-Morse Word , 1994, Inf. Process. Lett..

[9] Dominique Perrin. Symbolic Dynamics and Finite Automata , 1995, MFCS.

[10] R. McNaughton,et al. Counter-Free Automata , 1971 .