Xavier Augros
Automata to Recognize Finite and Infinite Words with at Least Two Factorizations on a Given Finite Set
CIAA, 1998.
@inproceedings{WIA-1998-Augros,
author = "Xavier Augros",
booktitle = "{Revised Papers of the Third International Workshop on Implementing Automata}",
doi = "10.1007/3-540-48057-9_20",
isbn = "3-540-66652-4",
pages = "220--225",
publisher = "{Springer-Verlag}",
series = "{Lecture Notes in Computer Science}",
title = "{Automata to Recognize Finite and Infinite Words with at Least Two Factorizations on a Given Finite Set}",
volume = 1660,
year = 1998,
}











