Abstract
We study stateless deterministic two-phase RR-automata of window size one: stl-det-2-RR(1)-automata. While general deterministic RR-automata of window size one characterize the regular languages, it turns out that the class of languages accepted by the stateless two-phase variants is subregular. Therefore we combine stl-det-2-RR(1)-automata into computationally stronger cooperating distributed systems, obtaining the stl-det-local-CD-2-RR(1)-systems. By limiting their inherent nondeterminism, two further variants are derived. The relations between the different classes and some well-known language families are investigated, and it is shown that the classes defined here form a finite hierarchy whose levels are incomparable to several well-known language families. Further, closure properties and decision problems are studied for these classes.
Access provided by Autonomous University of Puebla. Download to read the full chapter text
Chapter PDF
Similar content being viewed by others
Keywords
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.
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)
Culy, C.: Formal properties of natural language and linguistic theories. Linguistics and Philosophy 19, 599–617 (1996)
Dassow, J., Păun, G., Rozenberg, G.: Grammar systems. In: Rozenberg, G., Salomaa, A. (eds.) Handbook of Formal Languages, vol. 2, pp. 155–213. Springer, Berlin (1997)
Diekert, V., Rozenberg, G.: The Book of Traces. World Scientific, Singapore (1995)
Harrison, M.A.: Introduction to Formal Language Theory. Addison-Wesley, Reading (1978)
Ibarra, O., Karhumäki, J., Okhotin, A.: On stateless multihead automata: Hierarchies and the emptiness problem. Theoret. Comput. Sci. 411, 581–593 (2009)
Kutrib, M., Messerschmidt, H., Otto, F.: On stateless two-pushdown automata and restarting automata. Int. J. Found. Comput. Sci. 21, 781–798 (2010)
Kutrib, M., Messerschmidt, H., Otto, F.: On stateless deterministic restarting automata. Acta Inform. 47, 391–412 (2010)
Kutrib, M., Reimann, J.: Succinct description of regular languages by weak restarting automata. Inform. Comput. 206, 1152–1160 (2008)
Lautemann, C.: One pushdown and a small tape. In: Dirk Siefkes zum 50. Geburtstag, pp. 42–47. TU Berlin and Universität Augsburg (1988)
McNaughton, R., Narendran, P., Otto, F.: Church-Rosser Thue systems and formal languages. J. ACM 35, 324–344 (1988)
Messerschmidt, H., Otto, F.: Cooperating distributed systems of restarting automata. Int. J. Found. Comput. Sci. 18, 1333–1342 (2007)
Messerschmidt, H., Otto, F.: Strictly Deterministic CD-Systems of Restarting Automata. In: Csuhaj-Varjú, E., Ésik, Z. (eds.) FCT 2007. LNCS, vol. 4639, pp. 424–434. Springer, Heidelberg (2007)
Nagy, B., Otto, F.: CD-Systems of Stateless Deterministic R(1)-Automata Accept All Rational Trace Languages. In: Dediu, A.-H., Fernau, H., Martín-Vide, C. (eds.) LATA 2010. LNCS, vol. 6031, pp. 463–474. Springer, Heidelberg (2010)
Nagy, B., Otto, F.: Globally Deterministic CD-Systems of Stateless R(1)-Automata. In: Dediu, A.-H., Inenaga, S., Martín-Vide, C. (eds.) LATA 2011. LNCS, vol. 6638, pp. 390–401. Springer, Heidelberg (2011)
Post, E.L.: A variant of a recursively unsolvable problem. Bull. AMS 52, 264–268 (1946)
Salomaa, A.: Formal Languages. Academic Press, New York (1973)
Yang, L., Dang, Z., Ibarra, O.: On stateless automata and P systems. In: Workshop on Automata for Cellular and Molecular Computing, pp. 144–157. MTA SZTAKI (2007)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2012 Springer-Verlag Berlin Heidelberg
About this chapter
Cite this chapter
Kutrib, M., Otto, F. (2012). On CD-Systems of Stateless Deterministic Two-Phase RR(1)-Automata. In: Bordihn, H., Kutrib, M., Truthe, B. (eds) Languages Alive. Lecture Notes in Computer Science, vol 7300. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-31644-9_8
Download citation
DOI: https://doi.org/10.1007/978-3-642-31644-9_8
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-31643-2
Online ISBN: 978-3-642-31644-9
eBook Packages: Computer ScienceComputer Science (R0)