On degrees of ambiguity for Büchi tree automata

Alexander Rabinovich, Doron Tiferet

Research output: Contribution to journalArticlepeer-review

Abstract

An automaton is unambiguous if for every input it has at most one accepting computation. An automaton is finitely (respectively, countably) ambiguous if for every input it has at most finitely (respectively, countably) many accepting computations. An automaton is boundedly ambiguous if there is k∈N, such that for every input it has at most k accepting computations. We consider nondeterministic Büchi automata (NBA) over infinite trees and prove that it is decidable in polynomial time, whether an automaton is unambiguous, boundedly ambiguous, finitely ambiguous, or countably ambiguous.

Original languageEnglish
Article number104750
JournalInformation and Computation
Volume281
DOIs
StatePublished - Dec 2021

Keywords

  • Automata ambiguity
  • Büchi automata

Fingerprint

Dive into the research topics of 'On degrees of ambiguity for Büchi tree automata'. Together they form a unique fingerprint.

Cite this