On the Expressive Power of Stateless Ordered Restart-Delete Automata Article Swipe
Related Concepts
Stateless protocol
Computer science
Automaton
Swift
Context (archaeology)
Class (philosophy)
Theoretical computer science
Algorithm
State (computer science)
Programming language
Artificial intelligence
Biology
Paleontology
Friedrich Otto
·
YOU?
·
· 2021
· Open Access
·
· DOI: https://doi.org/10.1007/s00224-020-10028-3
· OA: W3139299110
YOU?
·
· 2021
· Open Access
·
· DOI: https://doi.org/10.1007/s00224-020-10028-3
· OA: W3139299110
Stateless ordered restart-delete automata (stl-ORD-automata) are studied. These are obtained from the stateless ordered restarting automata (stl-ORWW-automata) by introducing an additional restart-delete operation, which, based on the surrounding context, deletes a single letter. While the stl-ORWW-automata accept the regular languages, we show that the swift stl-ORD-automata yield a characterization for the class of context-free languages. Here a stl-ORD-automaton is called swift if it can move its window to any position after performing a restart. We also study the descriptional complexity of swift stl-ORD-automata and relate them to limited context restarting automata.
Related Topics
Finding more related topics…