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.
This work was partially supported by the Grant Agency of Charles University under Grant-No. 272111/MFF/A-INF and by the Czech Science Foundation under Grant-No. P103/10/0783 and Grant-No. P202/10/1333.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Č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
Černo, P., Mráz, F.: Clearing restarting automata. Fundamenta Informaticae 104(1), 17–54 (2010)
Č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
Hall, P.: On Representatives of Subsets. Journal of the London Mathematical Society s1-10(1), 26–30 (1935)
Hopcroft, J.E., Ullman, J.D.: Formal Languages and their Relation to Automata. Addison-Wesley, Reading (1969)
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)
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)
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)
Kutrib, M., Messerschmidt, H., Otto, F.: On stateless deterministic restarting automata. Acta Inf. 47, 391–412 (2010)
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)
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)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2011 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Černo, P., Mráz, F. (2011). Δ-Clearing Restarting Automata and \(\makebox{\sf CFL} \) . In: Mauri, G., Leporati, A. (eds) Developments in Language Theory. DLT 2011. Lecture Notes in Computer Science, vol 6795. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-22321-1_14
Download citation
DOI: https://doi.org/10.1007/978-3-642-22321-1_14
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-22320-4
Online ISBN: 978-3-642-22321-1
eBook Packages: Computer ScienceComputer Science (R0)