@inproceedings{10.1007/978-3-319-98654-8_44,
    Abstract = {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 {\$}{\$}{\backslash}omega {\$}{\$}-language accepted by a finitely ambiguous B{\"u}chi automaton with n states is accepted by an unambiguous B{\"u}chi automaton with {\$}{\$}2{\backslash}times 5^n{\$}{\$}states.},
    Address = {Cham},
    Author = {Rabinovich, Alexander},
    BookTitle = {Developments in Language Theory},
    Editor = {Hoshi, Mizuho and Seki, Shinnosuke},
    File = {Rabinovich2018\_Chapter\_ComplementationOfFinitelyAmbig (0) - a - a - g.pdf},
    ISBN = {978-3-319-98654-8},
    Pages = {541--552},
    Publisher = {Springer International Publishing},
    Title = {Complementation of Finitely Ambiguous B{\"u}chi Automata},
    Year = {2018},
    date-added = {2018-10-08 08:14:57 +0000},
    date-modified = {2018-10-08 08:14:57 +0000},
    doi = {10.1007/978-3-319-98654-8_44}
}

@inproceedings{10.1007/978-3-319-98654-8_44, Abstract = {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 {\$}{\$}{\backslash}omega {\$}{\$}-language accepted by a finitely ambiguous B{\"u}chi automaton with n states is accepted by an unambiguous B{\"u}chi automaton with {\$}{\$}2{\backslash}times 5^n{\$}{\$}states.}, Address = {Cham}, Author = {Rabinovich, Alexander}, BookTitle = {Developments in Language Theory}, Editor = {Hoshi, Mizuho and Seki, Shinnosuke}, File = {Rabinovich2018_Chapter_ComplementationOfFinitelyAmbig (0) - a - a - g.pdf}, ISBN = {978-3-319-98654-8}, Pages = {541--552}, Publisher = {Springer International Publishing}, Title = {Complementation of Finitely Ambiguous B{\"u}chi Automata}, Year = {2018}, date-added = {2018-10-08 08:14:57 +0000}, date-modified = {2018-10-08 08:14:57 +0000}, doi = {10.1007/978-3-319-98654-8_44} }