Hybrid extended 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:
CIAA'06 Proceedings of the 11th international conference on Implementation and Application of Automata
Year:
2006

Citing 7
Cited 2

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
Revolving-input finite automata

DLT'05 Proceedings of the 9th international conference on Developments in Language Theory
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

Quantified Score

Hi-index	0.00

Visualization

Abstract

Extended finite automata are finite state automata equipped with the additional ability to apply an operation on the currently remaining input word, depending on the current state. Hybrid extended finite automata can choose from a finite set of such operations. In this paper, five word operations are taken into consideration which always yield letter-equivalent results, namely reversal and shift operations. The computational power of those machines is investigated, locating the corresponding families of languages in the Chomsky hierarchy. Furthermore, different types of hybrid extended finite automata, defined by the set of operations they are allowed to apply, are compared with each other, demonstrating that there exist dependencies and independencies between the input manipulating operations.