Automata to Recognize Finite and Infinite Words with at Least Two Factorizations on a Given Finite Set

Xavier Augros. Automata to Recognize Finite and Infinite Words with at Least Two Factorizations on a Given Finite Set. In Jean-Marc Champarnaud, Denis Maurel, Djelloul Ziadi, editors, Automata Implementation, Third International Workshop on Implementing Automata, WIA 98, Rouen, France, September 17-19, 1998, Revised Papers. Volume 1660 of Lecture Notes in Computer Science, pages 220-225, Springer, 1998. [doi]

Abstract

Abstract is missing.