On Lookahead Hierarchies for Monotone and Deterministic Restarting Automata with Auxiliary Symbols (Extended Abstract)

  • Natalie Schluter
Part of the Lecture Notes in Computer Science book series (LNCS, volume 6224)


A restarting automaton is a special type of linearly bounded automaton with fixed lookahead length k, whose computation proceeds in cycles performing one length-reducing rewrite of the lookahead contents per cycle as the only modification of the input. Through various restrictions on this machine model, a vast number of traditional and new language classes have been excavated. In two studies on lookahead hierarchies for restarting automata without auxiliary symbols [2,3], it was shown that lookahead length is often a significant restriction on the power of these types of restarting automata. No similar study on lookahead hierarchies for restarting automata with auxiliary symbols has been explicitly carried out.


  1. 1.
    Jančar, P., Mráz, F., Plátek, M., Vogel, J.: On monotonic automata with a restart operation. Journal of Automata, Languages and Combinatorics 4(4), 287–312 (1999)zbMATHMathSciNetGoogle Scholar
  2. 2.
    Mráz, F.: Lookahead hierarchies of restarting automata. Journal of Automata, Languages and Combinatorics 6(4), 493–506 (2001)zbMATHMathSciNetGoogle Scholar
  3. 3.
    Mráz, F., Otto, F.: Hiearchies of weakly monotone restarting automata. RAIRO-Theoretical Informatics and Applications 39(2), 325–342 (2005)zbMATHCrossRefGoogle Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2010

Authors and Affiliations

  • Natalie Schluter
    • 1
  1. 1.IT University of CopenhagenCopenhagen S.Denmark

Personalised recommendations