On the complexity of parity word automata

Valerie King; Orna Kupferman; Moshe Y. Vardi

doi:10.1007/3-540-45315-6_18

On the complexity of parity word automata

Valerie King, Orna Kupferman, Moshe Y. Vardi

The Rachel and Selim Benin School of Engineering and Computer Science

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › peer-review

31 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 language	English
Title of host publication	Foundations 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
Editors	Furio Honsell, Marino Miculan
Publisher	Springer Verlag
Pages	276-286
Number of pages	11
ISBN (Print)	3540418644
DOIs	https://doi.org/10.1007/3-540-45315-6_18
State	Published - 2001
Event	4th 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 2001 → 6 Apr 2001

Publication series

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

Conference

Conference	4th 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/Territory	Italy
City	Genova
Period	2/04/01 → 6/04/01

Bibliographical note

Publisher Copyright:
© Springer-Verlag Berlin Heidelberg 2001.

Access to Document

10.1007/3-540-45315-6_18

Cite this

King, V., Kupferman, O., & Vardi, M. Y. (2001). On the complexity of parity word automata. In F. Honsell, & M. Miculan (Eds.), Foundations 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 (pp. 276-286). (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 2030). Springer Verlag. https://doi.org/10.1007/3-540-45315-6_18

King, Valerie ; Kupferman, Orna ; Vardi, Moshe Y. / On the complexity of parity word automata. Foundations 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. editor / Furio Honsell ; Marino Miculan. Springer Verlag, 2001. pp. 276-286 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)).

@inproceedings{092b0433bbab4f5d9b00a0ee81956e7b,

title = "On the complexity of parity word automata",

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{\"u}chi automaton is quadratic: a parity automaton with n states, m transitions, and index k may result in a B{\"u}chi automaton of size O((n + m)k). The best known algorithm for the nonemptiness problem of parity automata goes through B{\"u}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{\"u}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).",

author = "Valerie King and Orna Kupferman and Vardi, {Moshe Y.}",

note = "Publisher Copyright: {\textcopyright} Springer-Verlag Berlin Heidelberg 2001.; 4th 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 ; Conference date: 02-04-2001 Through 06-04-2001",

year = "2001",

doi = "10.1007/3-540-45315-6_18",

language = "אנגלית",

isbn = "3540418644",

series = "Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)",

publisher = "Springer Verlag",

pages = "276--286",

editor = "Furio Honsell and Marino Miculan",

booktitle = "Foundations 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",

address = "גרמניה",

}

King, V, Kupferman, O & Vardi, MY 2001, On the complexity of parity word automata. in F Honsell & M Miculan (eds), Foundations 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. Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), vol. 2030, Springer Verlag, pp. 276-286, 4th 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, 2/04/01. https://doi.org/10.1007/3-540-45315-6_18

On the complexity of parity word automata. / King, Valerie; Kupferman, Orna; Vardi, Moshe Y.
Foundations 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. ed. / Furio Honsell; Marino Miculan. Springer Verlag, 2001. p. 276-286 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 2030).

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › peer-review

TY - GEN

T1 - On the complexity of parity word automata

AU - King, Valerie

AU - Kupferman, Orna

AU - Vardi, Moshe Y.

N1 - Publisher Copyright: © Springer-Verlag Berlin Heidelberg 2001.

PY - 2001

Y1 - 2001

N2 - 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).

AB - 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).

UR - http://www.scopus.com/inward/record.url?scp=84945288929&partnerID=8YFLogxK

U2 - 10.1007/3-540-45315-6_18

DO - 10.1007/3-540-45315-6_18

M3 - ???researchoutput.researchoutputtypes.contributiontobookanthology.conference???

AN - SCOPUS:84945288929

SN - 3540418644

T3 - Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

SP - 276

EP - 286

BT - Foundations 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

A2 - Honsell, Furio

A2 - Miculan, Marino

PB - Springer Verlag

T2 - 4th 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

Y2 - 2 April 2001 through 6 April 2001

ER -

King V, Kupferman O, Vardi MY. On the complexity of parity word automata. In Honsell F, Miculan M, editors, Foundations 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. Springer Verlag. 2001. p. 276-286. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)). doi: 10.1007/3-540-45315-6_18

On the complexity of parity word automata

Abstract

Publication series

Conference

Bibliographical note

Access to Document

Other files and links

Fingerprint

Cite this