Removing bidirectionality from nondeterministic finite automata

Authors:
Christos Kapoutsis
Affiliations:
Computer Science and Artificial Intelligence Laboratory, Massachusetts Institute of Technology
Venue:
MFCS'05 Proceedings of the 30th international conference on Mathematical Foundations of Computer Science
Year:
2005

Citing 9
Cited 9

A note on the reduction of two-way automata to one-way atuomata

Information Processing Letters
Separating Exponentially Ambiguous Finite Automata from Polynomially Ambiguous Finite Automata

SIAM Journal on Computing
Introduction To Automata Theory, Languages, And Computation

Introduction To Automata Theory, Languages, And Computation
Nondeterminism and the size of two way finite automata

STOC '78 Proceedings of the tenth annual ACM symposium on Theory of computing
A Two-Way Automaton with Fewer States than Any Equivalent One-Way Automaton

IEEE Transactions on Computers
On the Bounds for State-Set Size in the Proofs of Equivalence Between Deterministic, Nondeterministic, and Two-Way Finite Automata

IEEE Transactions on Computers
Economy of description by automata, grammars, and formal systems

SWAT '71 Proceedings of the 12th Annual Symposium on Switching and Automata Theory (swat 1971)
Finite automata and their decision problems

IBM Journal of Research and Development
The reduction of two-way automata to one-way automata

IBM Journal of Research and Development

Nondeterministic Finite Automata--Recent Results on the Descriptional and Computational Complexity

CIAA '08 Proceedings of the 13th international conference on Implementation and Applications of Automata
On the State Complexity of Operations on Two-Way Finite Automata

DLT '08 Proceedings of the 12th international conference on Developments in Language Theory
Deterministic moles cannot solve liveness

Journal of Automata, Languages and Combinatorics
Complexity of multi-head finite automata: Origins and directions

Theoretical Computer Science
Describing periodicity in two-way deterministic finite automata using transformation semigroups

DLT'11 Proceedings of the 15th international conference on Developments in language theory
Oblivious two-way finite automata: decidability and complexity

LATIN'12 Proceedings of the 10th Latin American international conference on Theoretical Informatics
State complexity of operations on two-way finite automata over a unary alphabet

Theoretical Computer Science
State Complexity of Union and Intersection for Two-way Nondeterministic Finite Automata

Fundamenta Informaticae - Theory that Counts: To Oscar Ibarra on His 70th Birthday
Minicomplexity

DCFS'12 Proceedings of the 14th international conference on Descriptional Complexity of Formal Systems

Quantified Score

Hi-index	0.00

Visualization

Abstract

We prove that every two-way nondeterministic finite automaton with n states has an equivalent one-way nondeterministic finite automaton with at most ($^{2n}_{n+1}$) states. We also show this bound is exact.