Abstract
We consider 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, some closure and nonclosure properties for the class of languages accepted by deterministic ordered restart-delete automata are presented.
Full Text 
Sign-in/Register to access full text options
Sign-in/Register to access full text options 
Paper version not known
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a call
