Abstract
We introduce a new mode of operation for CD-systems of restarting automata by providing explicit enable and disable conditions in the form of regular constraints. We show that, for each CD-system \({\cal M}\) of restarting automata and each mode m of operation considered by Messerschmidt and Otto, there exists a CD-system \({\cal M}'\) of restarting automata of the same type as \({\cal M}\) that, working in the new mode ed, accepts the language \(L_{\sf m}({\cal M})\) that \(\cal M\) accepts in mode m. Further, we will see that in mode ed, a locally deterministic CD-system of restarting automata of type RR(W)(W) can be simulated by a locally deterministic CD-system of restarting automata of the more restricted type R(W)(W).
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
Similar content being viewed by others
References
Csuhaj-Varjú, E., Dassow, J., Kelemen, J., Păun, G.: Grammar Systems. A Grammatical Approach to Distribution and Cooperation. Gordon and Breach, London (1994)
Dassow, J., Kelemen, J.: Cooperating/Distributed Grammar Systems: A Link between Formal Languages and Artificial Intelligence. Bulletin of the EATCS 45, 131–145 (1991)
Jančar, P., Mráz, F., Plátek, M., Vogel, J.: Restarting Automata. In: Reichel, H. (ed.) FCT 1995. LNCS, vol. 965, pp. 283–292. Springer, Heidelberg (1995)
Messerschmidt, H., Otto, F.: On Nonforgetting Restarting Automata that Are Deterministic and/or Monotone. In: Grigoriev, D., Harrison, J., Hirsch, E.A. (eds.) CSR 2006. LNCS, vol. 3967, pp. 247–258. Springer, Heidelberg (2006)
Messerschmidt, H., Otto, F.: Cooperating Distributed Systems of Restarting Automata. Int. J. Found. Comput. Sci. 18, 1333–1342 (2007)
Messerschmidt, H., Otto, F.: On Deterministic CD-Systems of Restarting Automata. Int. J. Found. Comput. Sci. 20, 185–209 (2009)
Messerschmidt, H., Stamer, H.: Restart-Automaten mit mehreren Restart-Zuständen. In: Bordihn, H. (ed.) Workshop Formale Methoden in der Linguistik und 14. Theorietag Automaten und Formale Sprachen. Proc., Institut für Informatik, pp. 111–116. Universität Potsdam (2004)
Otto, F.: Restarting Automata and Their Relations to the Chomsky Hierarchy. In: Ésik, Z., Fülöp, Z. (eds.) DLT 2003. LNCS, vol. 2710, pp. 55–74. Springer, Heidelberg (2003)
Otto, F.: Restarting Automata. In: Ésik, Z., Martin-Vide, C., Mitrana, V. (eds.) Recent Advances in Formal Languages and Applications. Studies in Computational Intelligence, vol. 25, pp. 269–303. Springer, Berlin (2006)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2010 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Otto, F. (2010). CD-Systems of Restarting Automata Governed by Explicit Enable and Disable Conditions. In: van Leeuwen, J., Muscholl, A., Peleg, D., Pokorný, J., Rumpe, B. (eds) SOFSEM 2010: Theory and Practice of Computer Science. SOFSEM 2010. Lecture Notes in Computer Science, vol 5901. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-11266-9_52
Download citation
DOI: https://doi.org/10.1007/978-3-642-11266-9_52
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-11265-2
Online ISBN: 978-3-642-11266-9
eBook Packages: Computer ScienceComputer Science (R0)