Skip to Main content Skip to Navigation
Conference papers

Equivalence and Inclusion Problem for Strongly Unambiguous Büchi Automata

Christof Loeding 1 Nicolas Bousquet 2
2 ALGCO - Algorithmes, Graphes et Combinatoire
LIRMM - Laboratoire d'Informatique de Robotique et de Microélectronique de Montpellier
Abstract : 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.
Document type :
Conference papers
Complete list of metadata
Contributor : Nicolas Bousquet Connect in order to contact the contributor
Submitted on : Monday, October 15, 2012 - 4:08:17 PM
Last modification on : Monday, October 11, 2021 - 1:24:07 PM


  • HAL Id : lirmm-00741988, version 1



Christof Loeding, Nicolas Bousquet. Equivalence and Inclusion Problem for Strongly Unambiguous Büchi Automata. LATA'10: Language and Automata Theory and Applications, Germany. pp.118-129. ⟨lirmm-00741988⟩



Record views