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 metadatas

https://hal-lirmm.ccsd.cnrs.fr/lirmm-00741988
Contributor : Nicolas Bousquet <>
Submitted on : Monday, October 15, 2012 - 4:08:17 PM
Last modification on : Thursday, May 31, 2018 - 2:54:03 PM

Identifiers

  • HAL Id : lirmm-00741988, version 1

Collections

Citation

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⟩

Share

Metrics

Record views

149