On the power of nondeterminism in small two-way finite automata
Thesis (S.M.)--Massachusetts Institute of Technology, Dept. of Electrical Engineering and Computer Science, 2004.
Main Author: | Kapoutsis, Christos, 1974- |
---|---|
Other Authors: | Michael Sipser. |
Format: | Thesis |
Language: | en_US |
Published: |
Massachusetts Institute of Technology
2005
|
Subjects: | |
Online Access: | http://hdl.handle.net/1721.1/28559 |
Similar Items
-
Algorithms and lower bounds in finite automata size complexity
by: Kapoutsis, Christos, 1974-
Published: (2007) -
Systematic Removal of Nondeterminism for Code Generation in I/O Automata
by: Vaziri, Mandana, et al.
Published: (2005) -
Nondeterminism in Logics of Programs
by: Harel, David, et al.
Published: (2023) -
Unbounded nondeterminism in CSP
by: Roscoe, A, et al.
Published: (1989) -
Nondeterminator-3 : a provably good data-race detector that runs in parallel
by: Karunaratna, Tushara C
Published: (2007)