Contribution in edited book
On nonforgetting restarting automata that are deterministic and/or monotone



Publication Details
Authors:
Messerschmidt, H.; Otto, F.
Editor:
Grigoriev, D., Harrison, J. and Hirsch, E.A.
Publisher:
Springer
Place:
Berlin
Publication year:
2006
Pages range:
247-258
Book title:
International Computer Science Symposium in Russia, Proc. CSR 2006
Title of series:
Lecture Notes in Computer Science 3967

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.

Last updated on 2019-25-07 at 11:30

Share link