Δ-Clearing Restarting Automata and \(\makebox{\sf CFL} \)

  • Peter Černo
  • František Mráz
Part of the Lecture Notes in Computer Science book series (LNCS, volume 6795)

Abstract

Δ-clearing restarting automata represent a new restricted model of restarting automata which, based on a limited context, can either delete a substring of the current content of its tape or replace a substring by a special auxiliary symbol Δ, which cannot be overwritten anymore, but it can be deleted later. The main result of this paper consists in proving that besides their limited operations, Δ-clearing restarting automata recognize all context-free languages.

Keywords

analysis by reduction context-free languages Δ-clearing restarting automata formal languages 

References

  1. 1.
    Černo, P., Mráz, F.: Clearing restarting automata. In: Bordinh, H., Freund, R., Holzer, M., Kutrib, M., Otto, F. (eds.)Workshop on Non-Classical Models for Automata and Applications (NCMA), vol. 256, pp. 77–90. Österreichisches Computer Gesellschaft (2009), books@ocg.at Google Scholar
  2. 2.
    Černo, P., Mráz, F.: Clearing restarting automata. Fundamenta Informaticae 104(1), 17–54 (2010)MathSciNetMATHGoogle Scholar
  3. 3.
    Černo, P., Mráz, F.: Delta-clearing restarting automata and CFL. Tech. rep., Charles University, Faculty of Mathematics and Physics, Prague (2011), http://popelka.ms.mff.cuni.cz/cerno/files/cerno_mraz_dclra_and_cfl.pdf
  4. 4.
    Hall, P.: On Representatives of Subsets. Journal of the London Mathematical Society s1-10(1), 26–30 (1935)Google Scholar
  5. 5.
    Hopcroft, J.E., Ullman, J.D.: Formal Languages and their Relation to Automata. Addison-Wesley, Reading (1969)MATHGoogle Scholar
  6. 6.
    Jančar, P., Mráz, F., Plátek, M., Vogel, J.: Restarting automata. In: Reichel, H. (ed.) FCT 1995. LNCS, vol. 965, pp. 283–292. Springer, Heidelberg (1995)CrossRefGoogle Scholar
  7. 7.
    Kutrib, M., Messerschmidt, H., Otto, F.: On stateless two-pushdown automata and restarting automata. In: Csuhaj-Varjú, E., Ésik, Z. (eds.) Proc. of Automata and Formal Languages, AFL, pp. 257–268. Computer and Automation Research Institute, Hungarian Academy of Sciences, Budapest (2008)Google Scholar
  8. 8.
    Kutrib, M., Messerschmidt, H., Otto, F.: On stateless deterministic restarting automata. In: Nielsen, M., Kučera, A., Miltersen, P.B., Palamidessi, C., Tůma, P., Valencia, F. D (eds.) SOFSEM 2009. LNCS, vol. 5404, pp. 353–364. Springer, Heidelberg (2009)Google Scholar
  9. 9.
    Kutrib, M., Messerschmidt, H., Otto, F.: On stateless deterministic restarting automata. Acta Inf. 47, 391–412 (2010)MathSciNetCrossRefMATHGoogle Scholar
  10. 10.
    Kutrib, M., Messerschmidt, H., Otto, F.: On stateless two pushdown automata and restarting automata. International Journal of Foundations of Computer Science 21, 781–798 (2010)MathSciNetCrossRefMATHGoogle Scholar
  11. 11.
    Otto, F.: Restarting automata. In: Ésik, Z., Martín-Vide, C., Mitrana, V. (eds.) Recent Advances in Formal Languages and Applications. Studies in Computational Intelligence, vol. 25, pp. 269–303. Springer, Berlin (2006)Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2011

Authors and Affiliations

  • Peter Černo
    • 1
  • František Mráz
    • 1
  1. 1.Department of Computer ScienceCharles University, Faculty of Mathematics and PhysicsPRAHA 1Czech Republic

Personalised recommendations