TY - GEN
T1 - Degrees of ambiguity of Büchi tree automata
AU - Rabinovich, Alexander
AU - Tiferet, Doron
N1 - Publisher Copyright: © Alexander Rabinovich and Doron Tiferet; licensed under Creative Commons License CC-BY.
PY - 2019/12
Y1 - 2019/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 - Ambiguous automata
KW - Automata on infinite trees
UR - http://www.scopus.com/inward/record.url?scp=85077446426&partnerID=8YFLogxK
U2 - 10.4230/LIPIcs.FSTTCS.2019.50
DO - 10.4230/LIPIcs.FSTTCS.2019.50
M3 - منشور من مؤتمر
T3 - Leibniz International Proceedings in Informatics, LIPIcs
BT - 39th IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science, FSTTCS 2019
A2 - Chattopadhyay, Arkadev
A2 - Gastin, Paul
PB - Schloss Dagstuhl- Leibniz-Zentrum fur Informatik GmbH, Dagstuhl Publishing
T2 - 39th IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science, FSTTCS 2019
Y2 - 11 December 2019 through 13 December 2019
ER -