73
Views
8
CrossRef citations to date
0
Altmetric
Section A

Restarting automata with auxiliary symbols restricted by lookahead size

Pages 908-938 | Received 24 Sep 2011, Accepted 15 May 2014, Published online: 18 Jun 2014

References

  • K. Čulik II and R. Cohen, Lr-regular grammars – An extension of lr(k) grammars, J. Comput. Syst. Sci. 7(1) (1973), 66–96. doi: 10.1016/S0022-0000(73)80050-9
  • P. Jančar, F. Mráz, M. Plátek, and J. Vogel, On monotonic automata with a restart operation, J. Automata Lang. Comb. 4(4) (1999), pp. 287–312.
  • T. Jurdziński, F. Mráz, F. Otto, and M. Plátek, Degrees of non-monotonicity for restarting automata, Theor. Comput. Sci. 369 (2006), pp. 1–34. doi: 10.1016/j.tcs.2006.08.029
  • F. Mráz, Lookahead hierarchies of restarting automata, J. Automata Lang. Comb. 6(4) (2001), pp. 493–506.
  • F. Mráz and F. Otto, Hierarchies of weakly monotone restarting automata, RAIRO – Theor. Inform. Appl. 39(2) (2005), pp. 325–342. doi: 10.1051/ita:2005021
  • G. Niemann and F. Otto, Restarting automata and prefix rewriting systems, Tech. Rep., Kassel University, Kassel, 1999.
  • G. Niemann and F. Otto, Restarting automata, Church–Rosser languages, and representations of r.e. languages, in DLT’99 Proceedings, G. Rozenberg and W. Thomas, eds., World Scientific, Singapore, 2000, pp. 103–114.
  • G. Niemann and F. Otto, Further results on restarting automata, in Words, Languages and Combinatorics III, Proceedings, M. Ito and T. Imaoka, eds., World Scientific, Singapore, 2003, pp. 353–369.
  • F. Otto, Restarting automata, in Recent Advances in Formal Languages and Applications, Studies in Computational Intelligence, Vol. 25, Z. Esik, C. Martin-Vide, and V. Mitrana, eds., Springer-Verlag, Berlin, 2006, pp. 269–303.
  • F. Otto, Left-to-right regular languages and two-way restarting automata, RAIRO – Theor. Inform. Appl. 43 (2009), pp. 653–665. doi: 10.1051/ita/2009013
  • N. Schluter, On lookahead hierarchies for monotone and deterministic restarting automata with auxiliary symbols (extended abstract), in Proceedings of DLT, Lecture Notes in Computer Science, Vol. 6224, Y. Gao, H. Lu, S. Seki, and S. Yu, eds., Springer, Berlin, 2010, pp. 440–441.
  • N. Schluter, Restarting Automata with Auxiliary Symbols and Small Lookahead, Proceedings of LATA, Tarragona, Spain, 2011, pp. 499–510.

Reprints and Corporate Permissions

Please note: Selecting permissions does not provide access to the full text of the article, please see our help page How do I view content?

To request a reprint or corporate permissions for this article, please click on the relevant link below:

Academic Permissions

Please note: Selecting permissions does not provide access to the full text of the article, please see our help page How do I view content?

Obtain permissions instantly via Rightslink by clicking on the button below:

If you are unable to obtain permissions via Rightslink, please complete and submit this Permissions form. For more information, please visit our Permissions help page.