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. © 2011 Springer-Verlag.
Author supplied keywords
Cite
CITATION STYLE
Černo, P., & Mráz, F. (2011). Δ-clearing restarting automata and CFL. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 6795 LNCS, pp. 153–164). https://doi.org/10.1007/978-3-642-22321-1_14
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
