On the complexity of parity word automata

Valerie King, Orna Kupferman, Moshe Y. Vardi

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

29 Scopus citations

Abstract

Different types of nondeterministic automata on infinite words differ in their succinctness and in the complexity for their nonemptiness problem. A simple translation of a parity automaton to an equivalent Büchi automaton is quadratic: a parity automaton with n states, m transitions, and index k may result in a Büchi automaton of size O((n + m)k). The best known algorithm for the nonemptiness problem of parity automata goes through Büchi automata, leading to a complexity of O((n +m)k). In this paper we show that while the translation of parity automata to Büchi automata cannot be improved, the special structure of the acceptance condition of parity automata can be used in order to solve the nonemptiness problem directly, with a dynamic graph algorithm of complexity O((n + m) log k).

Original languageAmerican English
Title of host publicationFoundations of Software Science and Computation Structures - 4th International Conference, FOSSACS 2001 Held as Part of the Joint European Conferences on Theory and Practice of Software, ETAPS 2001, Proceedings
EditorsFurio Honsell, Marino Miculan
PublisherSpringer Verlag
Pages276-286
Number of pages11
ISBN (Print)3540418644
DOIs
StatePublished - 2001
Event4th International Conference on Foundations of Software Science and Computation Structures, FOSSACS 2001 Held as Part of the Joint European Conferences on Theory and Practice of Software, ETAPS 2001 - Genova, Italy
Duration: 2 Apr 20016 Apr 2001

Publication series

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

Conference

Conference4th International Conference on Foundations of Software Science and Computation Structures, FOSSACS 2001 Held as Part of the Joint European Conferences on Theory and Practice of Software, ETAPS 2001
Country/TerritoryItaly
CityGenova
Period2/04/016/04/01

Bibliographical note

Publisher Copyright:
© Springer-Verlag Berlin Heidelberg 2001.

Fingerprint

Dive into the research topics of 'On the complexity of parity word automata'. Together they form a unique fingerprint.

Cite this