Equivalence and Inclusion Problem for Strongly Unambiguous Büchi Automata [chapter]

Nicolas Bousquet, Christof Löding
2010 Lecture Notes in Computer Science  
We consider the inclusion and equivalence problem for unambiguous Büchi automata. We show that for a strong version of unambiguity introduced by Carton and Michel these two problems are solvable in polynomial time. We generalize this to Büchi automata with a fixed finite degree of ambiguity in the strong sense. We also discuss the problems that arise when considering the decision problems for the standard notion of ambiguity for Büchi automata.
doi:10.1007/978-3-642-13089-2_10 fatcat:wx5abl6o7ffh3idls3q73rtp2y