Deterministic Input-Reversal and Input-Revolving Finite Automata

  • Authors:

  • Suna Bensch;Henning Bordihn;Markus Holzer;Martin Kutrib

  • Affiliations:

  • Institut für Informatik, Universität Potsdam, Potsdam, Germany 14482;Institut für Informatik, Universität Giessen, Giessen, Germany 35392;Institut für Informatik, Technische Universität München, Garching bei München, Germany 85748;Institut für Informatik, Universität Giessen, Giessen, Germany 35392

  • Venue:
  • Language and Automata Theory and Applications
  • Year:
  • 2008

Quantified Score

Hi-index 0.00

Visualization

Abstract

Extended finite automata are finite state machines with the additional ability to manipulate the remaining part of the input. We investigate three types of deterministic extended automata, namely left-revolving, right-revolving, and input reversal finite automata. Concerning their computational capacity it is shown that nondeterminism is better than determinism, that is, for all three types of automata there is a language accepted by the nondeterministic versions but not accepted by any deterministic automaton of the same type. Concerning the closure properties most of the language families studied are not closed under standard operations. In particular, we show that the family of languages accepted by deterministic right-revolving finite automata is an anti-AFL which is not closed under reversal and intersection.