Complementation of Finitely Ambiguous Büchi Automata

Alexander Rabinovich*

*Corresponding author for this work

Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

9 Scopus citations


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.

Original languageEnglish
Title of host publicationDevelopments in Language Theory - 22nd International Conference, DLT 2018, Proceedings
EditorsMizuho Hoshi, Shinnosuke Seki
PublisherSpringer Verlag
Number of pages12
ISBN (Print)9783319986531
StatePublished - 2018
Event22nd International Conference on Developments in Language Theory, DLT 2018 - Tokyo, Japan
Duration: 10 Sep 201814 Sep 2018

Publication series

NameLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Volume11088 LNCS
ISSN (Print)0302-9743
ISSN (Electronic)1611-3349


Conference22nd International Conference on Developments in Language Theory, DLT 2018


Dive into the research topics of 'Complementation of Finitely Ambiguous Büchi Automata'. Together they form a unique fingerprint.

Cite this