A Characterization of the Context-Free Languages by Stateless Ordered Restart-Delete Automata
We consider stateless ordered restart-delete automata, which are actually just stateless ordered restarting automata (stl-ORWW-automata) that have an additional delete operation. While the stl-ORWW-automata just accept the regular languages, we show that the context-free languages are characterized by the swift stateless ordered restart-delete automaton, that is, by the stateless ordered restart-delete automaton that can move its window to any position after performing a restart.
KeywordsRestarting automaton Ordered rewriting Context-free language
- 7.Lopatková, M., Plátek, M., Sgall, P.: Towards a formal model for functional generative description: analysis by reduction and restarting automata. Prague Bull. Math. Linguist. 87, 7–26 (2007)Google Scholar
- 10.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)Google Scholar