Δ-clearing restarting automata and CFL

Authors:
Peter Černo;František Mráz
Affiliations:
Department of Computer Science, Charles University, Faculty of Mathematics and Physics, Praha 1, Czech Republic;Department of Computer Science, Charles University, Faculty of Mathematics and Physics, Praha 1, Czech Republic
Venue:
DLT'11 Proceedings of the 15th international conference on Developments in language theory
Year:
2011

Citing 5
Cited 0

Restarting Automata

FCT '95 Proceedings of the 10th International Symposium on Fundamentals of Computation Theory
Formal languages and their relation to automata

Formal languages and their relation to automata
On Stateless Deterministic Restarting Automata

SOFSEM '09 Proceedings of the 35th Conference on Current Trends in Theory and Practice of Computer Science
On stateless deterministic restarting automata

Acta Informatica
Clearing Restarting Automata

Fundamenta Informaticae - Non-Classical Models of Automata and Applications

Quantified Score

Hi-index	0.00

Visualization

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.