Abstract
The nonforgetting restarting automaton is a restarting automaton that is not forced to reset its internal state to the initial state when executing a restart operation. We analyse the expressive power of the various deterministic and/or monotone variants of this model. © Springer-Verlag Berlin Heidelberg 2006.
Cite
CITATION STYLE
APA
Messerschmidt, H., & Otto, F. (2006). On nonforgetting restarting automata that are deterministic and/or monotone. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 3967 LNCS, pp. 247–258). Springer Verlag. https://doi.org/10.1007/11753728_26
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
Already have an account? Sign in
Sign up for free