| Article ID | Journal | Published Year | Pages | File Type |
|---|---|---|---|---|
| 428799 | Information Processing Letters | 2007 | 4 Pages |
Abstract
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.
Related Topics
Physical Sciences and Engineering
Computer Science
Computational Theory and Mathematics
