TY - JOUR

T1 - On degrees of ambiguity for Büchi tree automata

AU - Rabinovich, Alexander

AU - Tiferet, Doron

N1 - Publisher Copyright:
© 2021 Elsevier Inc.

PY - 2021/12

Y1 - 2021/12

N2 - 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.

AB - 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.

KW - Automata ambiguity

KW - Büchi automata

UR - http://www.scopus.com/inward/record.url?scp=85105757767&partnerID=8YFLogxK

U2 - 10.1016/j.ic.2021.104750

DO - 10.1016/j.ic.2021.104750

M3 - מאמר

AN - SCOPUS:85105757767

VL - 281

JO - Information and Computation

JF - Information and Computation

SN - 0890-5401

M1 - 104750

ER -