Abstract
We consider deterministic ordered restart-delete automata, which are actually just deterministic ordered restarting automata (det-ORWW-automata) that have an additional delete operation. We show that these automata don’t need states, that they accept all deterministic context-free languages, and that they even accept some languages that are not deterministic context-free. On the other hand, these automata only accept languages that are at the same time context-free and Church-Rosser. In addition, closure properties for the class of languages accepted by these automata are studied.
Author supplied keywords
Cite
CITATION STYLE
Otto, F. (2018). On Deterministic Ordered Restart-Delete Automata. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 11088 LNCS, pp. 529–540). Springer Verlag. https://doi.org/10.1007/978-3-319-98654-8_43
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
