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

  • Peter Černo
  • František Mráz
Conference paper

DOI: 10.1007/978-3-642-22321-1_14

Part of the Lecture Notes in Computer Science book series (LNCS, volume 6795)
Cite this paper as:
Č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

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 

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

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