Oblivious two-way finite automata: decidability and complexity

Authors:
Martin Kutrib;Andreas Malcher;Giovanni Pighizzini
Affiliations:
Institut für Informatik, Universität Giessen, Giessen, Germany;Institut für Informatik, Universität Giessen, Giessen, Germany;Dipartimento di Informatica e Comunicazione, Università degli Studi di Milano, Milano, Italy
Venue:
LATIN'12 Proceedings of the 10th Latin American international conference on Theoretical Informatics
Year:
2012

Citing 21
Cited 0

Finite automata and unary languages

Theoretical Computer Science
Nondeterministic computations in sublogarithmic space and space constructibility

SIAM Journal on Computing
Intersection and union of regular languages and state complexity

Information Processing Letters
A lower bound technique for the size of nondeterministic finite automata

Information Processing Letters
Introduction To Automata Theory, Languages, And Computation

Introduction To Automata Theory, Languages, And Computation
Optimal Simulations between Unary Automata

SIAM Journal on Computing
Multi-head finite automata: data-independent versus data-dependent computations

Theoretical Computer Science
The Head Hierarchy for Oblivious Finite Automata with Polynomial Advice Collapses

MFCS '98 Proceedings of the 23rd International Symposium on Mathematical Foundations of Computer Science
Data-Independences of Parallel Random Access Machines

Proceedings of the 13th Conference on Foundations of Software Technology and Theoretical Computer Science
Converting two-way nondeterministic unary automata into simpler automata

Theoretical Computer Science - Mathematical foundations of computer science
Nondeterminism and the size of two way finite automata

STOC '78 Proceedings of the tenth annual ACM symposium on Theory of computing
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)
Lower bounds on the size of sweeping automata

Journal of Automata, Languages and Combinatorics
A technique for proving lower bounds on the size of sweeping automata

Journal of Automata, Languages and Combinatorics
Finite automata and their decision problems

IBM Journal of Research and Development
Nondeterminism versus determinism for two-way finite automata: generalizations of Sipser's separation

ICALP'03 Proceedings of the 30th international conference on Automata, languages and programming
Complexity of multi-head finite automata: Origins and directions

Theoretical Computer Science
Two-way unary automata versus logarithmic space

Information and Computation
Two-way automata versus logarithmic space

CSR'11 Proceedings of the 6th international conference on Computer science: theory and applications
Removing bidirectionality from nondeterministic finite automata

MFCS'05 Proceedings of the 30th international conference on Mathematical Foundations of Computer Science

Quantified Score

Hi-index	0.00

Visualization

Abstract

We investigate the descriptional complexity and decidability of obliviousness for two-way finite automata. In particular, we consider the simulation of two-way deterministic finite automata (2DFAs) by oblivious 2DFAs, the simulation of oblivious 2DFAs by sweeping 2DFAs and one-way nondeterministic finite automata (1NFAs) as well as the simulation of sweeping 2DFAs by 1NFAs. In all cases exponential upper and lower bounds on the number of states are obtained for languages over an alphabet with at most four latters. Moreover, it is shown that obliviousness is decidable for 2DFAs.