Abstract
The problem of determining whether several finite automata accept a common word is closely related to the well-studied membership problem in transformation monoids. We review the complexity of the intersection problem and raise the issue of limiting the number of final states in the automata involved. In particular, we consider commutative automata with at most two final states and we partially elucidate the complexity of their intersection nonemptiness and related problems. © 2012 Springer-Verlag.
Cite
CITATION STYLE
Blondin, M., & McKenzie, P. (2012). The complexity of intersecting finite automata having few final states. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 7353 LNCS, pp. 31–42). https://doi.org/10.1007/978-3-642-30642-6_4
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
