Publication at Faculty of Mathematics and Physics |
2017
Abstract
We study deterministic restarting automata with two windows. In each cycle of a computation, these det-2-RR-automata can perform up to two delete operations, one with each of their two windows.
We study the class of languages accepted by these automata, comparing it to other well-known language classes and exploring closure properties.