Codeterministic automata on infinite words
References (3)
There are more references available in the full text version of this article.
Cited by (7)
Unambiguous Büchi automata
2003, Theoretical Computer ScienceConfluent linear numeration systems
1992, Theoretical Computer ScienceThe three subfamilies of rational ω-languages closed under ω-transduction
1990, Theoretical Computer ScienceForms of determinism for automata
2012, Leibniz International Proceedings in Informatics, LIPIcsMonadic logic of order over naturals has no finite base
2002, Journal of Logic and ComputationUnambiguous Büchi automata
2000, Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Copyright © 1985 Published by Elsevier B.V.