2026-09-20T00:23:31Zhttps://dspace.mit.edu/server/oai/requestoai:dspace.mit.edu:1721.1/285592022-01-13T07:54:29Zcom_1721.1_7582com_1721.1_7581col_1721.1_131023
Michael Sipser.
Kapoutsis, Christos, 1974-
Massachusetts Institute of Technology. Dept. of Electrical Engineering and Computer Science.
Massachusetts Institute of Technology. Department of Electrical Engineering and Computer Science
2005-09-27T17:00:32Z
2005-09-27T17:00:32Z
2004
2004
http://hdl.handle.net/1721.1/28559
57418399
Thesis (S.M.)--Massachusetts Institute of Technology, Dept. of Electrical Engineering and Computer Science, 2004.
Includes bibliographical references (p. 25-26).
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.
by Christos Kapoutsis.
S.M.
26 p.
1416389 bytes
1416574 bytes
application/pdf
application/pdf
en_US
Massachusetts Institute of Technology
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.
http://dspace.mit.edu/handle/1721.1/7582
Electrical Engineering and Computer Science.
On the power of nondeterminism in small two-way finite automata
On the power of nondeterminism in small 2DFA
Thesis
application/pdf
false
Publication
unknown
unknown
<Publication xmlns="https://www.openaire.eu/cerif-profile/1.1/" id="e42d0843-a9d2-4d70-b3fd-a63a33d3f22c">
<Type xmlns="https://www.openaire.eu/cerif-profile/vocab/COAR_Publication_Types">http://purl.org/coar/resource_type/c_1843</Type>
<Language>en_US</Language>
<Title>On the power of nondeterminism in small two-way finite automata</Title>
<Subtitle>On the power of nondeterminism in small 2DFA</Subtitle>
<PublishedIn>
<Publication>
</Publication>
</PublishedIn>
<PublicationDate>2004</PublicationDate>
<Authors>
<Author>
<DisplayName>Kapoutsis, Christos, 1974-</DisplayName>
<Affiliation>
<OrgUnit>
</OrgUnit>
</Affiliation>
</Author>
</Authors>
<Editors>
</Editors>
<Publishers>
<Publisher>
<DisplayName>Massachusetts Institute of Technology</DisplayName>
<OrgUnit />
</Publisher>
</Publishers>
<License>http://dspace.mit.edu/handle/1721.1/7582</License>
<Keyword>Electrical Engineering and Computer Science.</Keyword>
<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.</Abstract>
<Access xmlns="http://purl.org/coar/access_right"
>
</Access>
</Publication>