TY - GEN
T1 - Complementation of Finitely Ambiguous Büchi Automata
AU - Rabinovich, Alexander
N1 - Publisher Copyright:
© 2018, Springer Nature Switzerland AG.
PY - 2018
Y1 - 2018
N2 - A nondeterministic automaton is finitely ambiguous if for each input there is at most finitely many accepting runs. We prove that the complement of the w-language accepted by a finitely ambiguous Büchi automaton with n states is accepted by an unambiguous Büchi automaton with 2X5n states.
AB - A nondeterministic automaton is finitely ambiguous if for each input there is at most finitely many accepting runs. We prove that the complement of the w-language accepted by a finitely ambiguous Büchi automaton with n states is accepted by an unambiguous Büchi automaton with 2X5n states.
UR - http://www.scopus.com/inward/record.url?scp=85053887318&partnerID=8YFLogxK
U2 - 10.1007/978-3-319-98654-8_44
DO - 10.1007/978-3-319-98654-8_44
M3 - ???researchoutput.researchoutputtypes.contributiontobookanthology.conference???
AN - SCOPUS:85053887318
SN - 9783319986531
T3 - Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
SP - 541
EP - 552
BT - Developments in Language Theory - 22nd International Conference, DLT 2018, Proceedings
A2 - Hoshi, Mizuho
A2 - Seki, Shinnosuke
PB - Springer Verlag
T2 - 22nd International Conference on Developments in Language Theory, DLT 2018
Y2 - 10 September 2018 through 14 September 2018
ER -