On Nonforgetting Restarting Automata That Are Deterministic and/or Monotone

The nonforgetting restarting automaton is a restarting automaton that is not forced to reset its internal state to the initial state when executing a restart operation. We analyse the expressive power of the various deterministic and/or monotone variants of this model.

[1]  Friedrich Otto.  Restarting Automata and Their Relations to the Chomsky Hierarchy , 2003, Developments in Language Theory.

[2]  Martin Plátek,et al.  RESTARTING AUTOMATA: MOTIVATIONS AND APPLICATIONS , 2007 .

[3]  Frantisek Mráz,et al.  On Monotonic Automata with a Restart Operation , 1999, J. Autom. Lang. Comb..

[4]  Frantisek Mráz,et al.  Restarting Automata , 1995, FCT.

[5]  Burchard von Braunmühl,et al.  Finite-Change Automata , 1979, Theoretical Computer Science.

[6]  Friedrich Otto,et al.  Shrinking Restarting Automata , 2007, Int. J. Found. Comput. Sci..

[7]  Frantisek Mráz,et al.  On Left-Monotone Deterministic Restarting Automata , 2004, Developments in Language Theory.

[8]  Jeffrey D. Ullman,et al.  Introduction to Automata Theory, Languages and Computation , 1979 .

[9]  Frantisek Mráz,et al.  Monotone Deterministic RL-Automata Don't Need Auxiliary Symbols , 2005, Developments in Language Theory.

[10]  Gerhard Buntrock,et al.  Growing Context-Sensitive Languages and Church-Rosser Languages , 1998, Inf. Comput..

[11]  Grzegorz Rozenberg,et al.  Developments in Language Theory II , 2002 .

[12]  Michel Rigo,et al.  Abstract numeration systems and tilings , 2005 .

[13]  Karel Oliva,et al.  The Computational Complexity of Rule-Based Part-of-Speech Tagging , 2003, TSD.

[14]  Martin Plátek,et al.  Two-Way Restarting Automata and J-Monotonicity , 2001, SOFSEM.

[15]  Leszek Pacholski,et al.  SOFSEM 2001: Theory and Practice of Informatics , 2001, Lecture Notes in Computer Science.