Revolving-input finite automata

Authors:
Henning Bordihn;Markus Holzer;Martin Kutrib
Affiliations:
Institut für Informatik, Universität Potsdam, Potsdam, Germany;Institut für Informatik, Technische Universität München, Garching bei München, Germany;Institut für Informatik, Universität Giessen, Giessen, Germany
Venue:
DLT'05 Proceedings of the 9th international conference on Developments in Language Theory
Year:
2005

Citing 6
Cited 5

One-way stack automata

Journal of the ACM (JACM)
An Infinite Hierarchy of Context-Free Languages

Journal of the ACM (JACM)
Algebraic and Automata-Theoretic Properties of Formal Languages

Algebraic and Automata-Theoretic Properties of Formal Languages
A geometric hierarchy of languages

Journal of Computer and System Sciences
Flip-pushdown automata: k + 1 pushdown reversals are better than k

ICALP'03 Proceedings of the 30th international conference on Automata, languages and programming
Input reversals and iterated pushdown automata: a new characterization of khabbaz geometric hierarchy of languages

DLT'04 Proceedings of the 8th international conference on Developments in Language Theory

Deterministic Input-Reversal and Input-Revolving Finite Automata

Language and Automata Theory and Applications
On input-revolving deterministic and nondeterministic finite automata

Information and Computation
Hairpin finite automata

DLT'07 Proceedings of the 11th international conference on Developments in language theory
Gaining power by input operations: finite automata and beyond

CIAA'11 Proceedings of the 16th international conference on Implementation and application of automata
Hybrid extended finite automata

CIAA'06 Proceedings of the 11th international conference on Implementation and Application of Automata

Quantified Score

Hi-index	0.00

Visualization

Abstract

We introduce and investigate revolving-input finite automata, which are nondeterministic finite automata with the additional ability to shift the remaining part of the input. We consider three different modes of shifting, namely revolving to the left, revolving to the right, and circular interchanging. We show that the latter operation does not increase the computational power of finite automata, even if the number of revolving operations is unbounded. The same result is obtained for the former two operations in case of an arbitrary but constant number of applications allowed. An unbounded number of these operations leads to language families that are properly contained in the family of context-sensitive languages, are incomparable with the family of context-free languages, and are strictly more powerful than regular languages. Moreover, we show that right revolving can be simulated by left revolving, when considering the mirror image of the input.