A note on emptiness for alternating finite automata with a one-letter alphabet

We present a new proof of PSPACE-hardness of the emptiness problem for alternating finite automata with a singleton alphabet. This result was shown by Holzer (1995) who used a proof relying on a series of reductions from several papers. The new proof is simple, direct and self-contained.

Gespeichert in:

Bibliographische Detailangaben
Veröffentlicht in:	Information processing letters 2007-11, Vol.104 (5), p.164-167
Hauptverfasser:	Jančar, Petr, Sawa, Zdeněk
Format:	Artikel
Sprache:	eng
Schlagworte:	Algorithmics. Computability. Computer arithmetics Alternating finite automaton Applied sciences Computational complexity Computer science control theory systems Emptiness Exact sciences and technology Information processing Language theory and syntactical analysis Miscellaneous Studies Theoretical computing Vector space
Online-Zugang:	Volltext
Tags:	Tag hinzufügen Keine Tags, Fügen Sie den ersten Tag hinzu!

Beschreibung
Zusammenfassung:	We present a new proof of PSPACE-hardness of the emptiness problem for alternating finite automata with a singleton alphabet. This result was shown by Holzer (1995) who used a proof relying on a series of reductions from several papers. The new proof is simple, direct and self-contained.
ISSN:	0020-0190 1872-6119
DOI:	10.1016/j.ipl.2007.06.006