Equivalence and Inclusion Problem for Strongly Unambiguous Büchi Automata - LIRMM - Laboratoire d’Informatique, de Robotique et de Microélectronique de Montpellier Access content directly
Conference Papers Year : 2010

Equivalence and Inclusion Problem for Strongly Unambiguous Büchi Automata

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.
No file

Dates and versions

lirmm-00741988 , version 1 (15-10-2012)

Identifiers

  • HAL Id : lirmm-00741988 , version 1

Cite

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⟩
96 View
0 Download

Share

Gmail Facebook X LinkedIn More