Anzeige
Erschienen in:
2012 | OriginalPaper | Buchkapitel
Oblivious Two-Way Finite Automata: Decidability and Complexity
verfasst von : Martin Kutrib, Andreas Malcher, Giovanni Pighizzini
Erschienen in: LATIN 2012: Theoretical Informatics
Verlag: Springer Berlin Heidelberg
Aktivieren Sie unsere intelligente Suche, um passende Fachinhalte oder Patente zu finden.
Wählen Sie Textabschnitte aus um mit Künstlicher Intelligenz passenden Patente zu finden. powered by
Markieren Sie Textabschnitte, um KI-gestützt weitere passende Inhalte zu finden. powered by
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 (
$\textrm{2DFA}$
s) by oblivious
$\textrm{2DFA}$
s, the simulation of oblivious
$\textrm{2DFA}$
s by sweeping
$\textrm{2DFA}$
s and one-way nondeterministic finite automata (
$\textrm{1NFA}$
s) as well as the simulation of sweeping
$\textrm{2DFA}$
s by
$\textrm{1NFA}$
s. 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
$\textrm{2DFA}$
s.