Nondeterminism and the size of two way finite automata
STOC '78 Proceedings of the tenth annual ACM symposium on Theory of computing
The complexity of theorem-proving procedures
STOC '71 Proceedings of the third annual ACM symposium on Theory of computing
Succinctness of descriptions of context-free, regular and finite languages.
Succinctness of descriptions of context-free, regular and finite languages.
Proof of a conjecture of R. Kannan
STOC '89 Proceedings of the twenty-first annual ACM symposium on Theory of computing
Some applications of a technique of Sakoda and Sipser
ACM SIGACT News
On the Power of Las Vegas II. Two-Way Finite Automata
ICAL '99 Proceedings of the 26th International Colloquium on Automata, Languages and Programming
STOC '81 Proceedings of the thirteenth annual ACM symposium on Theory of computing
Alternation and the power of nondeterminism
STOC '83 Proceedings of the fifteenth annual ACM symposium on Theory of computing
Information Processing Letters
Describing periodicity in two-way deterministic finite automata using transformation semigroups
DLT'11 Proceedings of the 15th international conference on Developments in language theory
State complexity of operations on two-way finite automata over a unary alphabet
Theoretical Computer Science
| Hi-index | 0.00 |
Establishing good lower bounds on the complexity of languages is an important area of current research in the theory of computation. However, despite much effort, fundamental questions such as P &equil;? NP and L &equil;? NL remain open. To resolve these questions it may be necessary to develop a deep combinatorial understanding of polynomial time or log space computations, possibly a formidable task. One avenue for approaching these problems is to study weaker models of computation for which the analogous problems may be easier to settle, perhaps yielding insight into the original problems. Sakoda and Sipser [3] raise the following question about finite automata: Is there a polynomial p, such that every n-state 2nfa (two-way nondeterministic finite automaton) has an equivalent p(n)-state 2dfa? They conjecture a negative answer to this. In this paper we take a step toward proving this conjecture by showing that 2nfa are exponentially more succinct than 2dfa of a certain restricted form.