Sciweavers

IPL
2007

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

13 years 10 months ago
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. Key words: computational complexity, alternating finite automaton, emptiness
Petr Jancar, Zdenek Sawa
Added 15 Dec 2010
Updated 15 Dec 2010
Type Journal
Year 2007
Where IPL
Authors Petr Jancar, Zdenek Sawa
Comments (0)