The complexity of intersecting finite automata having few final states
Michael Blondin, Andreas Krebs, Pierre McKenzie · 2012
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. 1