On the power of nondeterminism in small two-way finite automata

We examine the conjecture that one-way nondeterministic finite automata (NFAS) can be exponentially more succinct than two-way deterministic ones (2DFAS); equivalently, that no polynomial-size sequence of 2DFAs can recognize B, for B a particular sequence of regular languages that is among the hardest of those recognizable by polynomial-size sequences of 1NFAs. We prove that the most natural single-pass 2DFA algorithm for deciding B fails, "single-pass" meaning that the automaton is bound to terminate as soon as it reaches an endmarker for the first time. On the way, we introduce the notion of dilemmas as an interesting general tool for constructing hard inputs for 2DFAS.

Department dc:contributor.department

Massachusetts Institute of Technology. Dept. of Electrical Engineering and Computer Science.

Grantor dc:publisher

Massachusetts Institute of Technology

Year dc:date.issued

2004

Author dc:creator

• Kapoutsis, Christos, 1974-

Advisor dc:contributor.advisor

• Michael Sipser.

• Electrical Engineering and Computer Science.

Statement dc:rights

• M.I.T. theses are protected by copyright. They may be viewed from this source for any purpose, but reproduction or distribution in any format is prohibited without written permission. See provided URL for inquiries about permission.

Licence dc:rights.uri

• http://dspace.mit.edu/handle/1721.1/7582

Language dc:language.iso

en_US

Handle dc:identifier.uri

http://hdl.handle.net/1721.1/28559

OAI identifier oai:identifier

oai:dspace.mit.edu:1721.1/28559