@incollection{CM11,
   author = {Peter {\v C}erno and Franti{\v s}ek Mr{\'a}z},
   affiliation = {Department of Computer Science, Charles University, Faculty of Mathematics and Physics, Malostransk{\'e} n{\'a}m. 25, 118 00 PRAHA 1, Czech Republic},
   title = {Delta-Clearing Restarting Automata and CFL},
   booktitle = {Developments in Language Theory},
   series = {Lecture Notes in Computer Science},
   editor = {Mauri, Giancarlo and Leporati, Alberto},
   publisher = {Springer Berlin / Heidelberg},
   isbn = {},
   pages = {153-164},
   volume = {6795},
   abstract = {Delta-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 Delta, which cannot be overwritten anymore,
               but it can be deleted later. The main result of this paper consists in the proving that beside
               their limited operations, Delta-clearing restarting automata recognize all context-free languages.},
   keywords = {analysis by reduction, context-free languages, Delta-clearing restarting automata, formal languages},
   url = {http://dx.doi.org/10.1007/978-3-642-22321-1_14},
   note = {10.1007/978-3-642-22321-1_14},
   year = {2011}
}