On the power of nondeterminism in small two-way finite automata
Name
57418399-MIT.pdf
Description
Full printable version
Size
1.35 MB
Format
Adobe PDF
Checksum (MD5)
cad9b6ed11e4f5ee8d9e69a84f9db861
Author(s)
Kapoutsis, Christos, 1974-
Advisor(s)
Michael Sipser.
Alternative Title
On the power of nondeterminism in small 2DFA
Date Issued
2004
Publisher
Massachusetts Institute of Technology
Abstract
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.
Description
Thesis (S.M.)--Massachusetts Institute of Technology, Dept. of Electrical Engineering and Computer Science, 2004.
Includes bibliographical references (p. 25-26).
Subjects
Electrical Engineering and Computer Science.
MIT Department
Massachusetts Institute of Technology. Department of Electrical Engineering and Computer Science
Terms of Use
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.
Persistent DSpace Link
