Skip to main content
SpringerLink
Log in

Deterministic pushdown-CD-systems of stateless deterministic R(1)-automata

  • Original Article
  • Published:
Acta Informatica Aims and scope Submit manuscript

Abstract

Recently the one-counter trace languages and the context-free trace languages have been characterized through restricted types of cooperating distributed systems (CD-systems) of stateless deterministic restarting automata with window size one (so-called stl-det-R(1)-automata) that work in mode ‘=1’ and that use an external counter or pushdown store to determine the successor components within computations. Here we study the deterministic variants of these CD-systems, comparing the resulting language classes to the classes of languages defined by CD-systems of stl-det-R(1)-automata without such an external device and to some classical language families, among them in particular the classes of rational, one-counter, and context-free trace languages. In addition, we present a large number of (non-)closure properties for our language classes.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Log in via an institution

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Fig. 1

Similar content being viewed by others

References

  • Aalbersberg, I., Rozenberg, G.: Theory of traces. Theor. Comput. Sci. 60, 1–82 (1988)

    Article  MathSciNet  MATH  Google Scholar 

  • Berstel, J.: Transductions and Context-Free Languages. Teubner, Stuttgart (1979)

    Book  MATH  Google Scholar 

  • Bertoni, A., Mauri, G., Sabadini, N.: Membership problems for regular and context-free trace languages. Inform. Comput. 82, 135–150 (1989)

    Article  MathSciNet  MATH  Google Scholar 

  • Bordihn, H., Holzer, M., Kutrib, M.: Input reversals and iterated pushdown automata: a new characterization of Khabbaz geometric hierarchy of languages. In: Calude, C.S., Calude, E., Dinneen, M.J. (eds.) DLT 2004, Proceedings. LNCS 3340, pp. 102–113. Springer, Berlin (2004)

  • Chottin, L.: Strict deterministic languages and controlled rewriting systems. In: Maurer, H. (ed.) ICALP 1979, Proceedings. LNCS 71, pp. 104–117. Springer, Berlin (1979)

  • Chottin, L.: Langages algébriques et systèmes de réècriture rationnels. RAIRO Theor. Inform. Appl. 16, 1–20 (1982)

    Google Scholar 

  • Csuhaj-Varjú, E., Dassow, J., Kelemen, J., Păun, G.: Grammar Systems—A Grammatical Approach to Distribution and Cooperation. Gordon and Breach, London (1994)

    MATH  Google Scholar 

  • Culy, C.: Formal properties of natural language and linguistic theories. Linguist. Philos. 19, 599–617 (1996)

    Article  Google Scholar 

  • Dahlhaus, E., Warmuth, M.: Membership for growing context-sensitive grammars is polynomial. J. Comput. Syst. Sci. 33, 456–472 (1986)

    Article  MathSciNet  MATH  Google Scholar 

  • Diekert, V., Rozenberg, G. (eds.): The Book of Traces. World Scientific, Singapore (1995)

    Google Scholar 

  • Duske, J., Parchmann, R.: Linear indexed languages. Theoret. Comput. Sci. 32, 47–60 (1984)

    Article  MathSciNet  MATH  Google Scholar 

  • Harrison, M.: Introduction to Formal Language Theory. Addison-Wesley, Reading, MA (1978)

    MATH  Google Scholar 

  • Jančar, P., Moller, F., Sawa, Z.: Simulation problems for one-counter machines. In: Pavelka, J., Tel, G., Bartošek, M. (eds.) SOFSEM’99, Proceedings. LNCS 1725, pp. 404–413. Springer, Berlin (1999)

  • Jančar, P., Mráz, F., Plátek, M., Vogel, J.: Restarting automata. In: Reichel, H. (ed.) FCT 1995, Proceedings. LNCS 965, pp. 283–292. Springer, Berlin (1995)

  • Kutrib, M., Messerschmidt, H., Otto, F.: On stateless two-pushdown automata and restarting automata. In: Csuhaj-Varjú, E., Ésik, Z. (eds.) AFL 2008, Proceedings, pp. 257–268. Hungarian Academy of Sciences (2008)

  • Kutrib, M., Messerschmidt, H., Otto, F.: On stateless two-pushdown automata and restarting automata. Int. J. Found. Comput. Sci. 21, 781–798 (2010)

    Article  MathSciNet  MATH  Google Scholar 

  • Lopatková, M., Plátek, M., Kubon, V.: Modeling syntax of free word-order languages: dependency analysis by reduction. In: Matoušek, V., Mautner, P., Pavelka, T. (eds.) Text, Speech and Dialogue, Proceedings, LNAI 3658. pp. 140–147, Springer, Berlin (2005)

  • Lopatková, M., Plátek, M., Sgall, P.: Towards a formal model for functional generative description—analysis by reduction and restarting automata. Prague Bull. Math. Linguist. 87, 7–26 (2007)

    Google Scholar 

  • McNaughton, R., Narendran, P., Otto, F.: Church-Rosser Thue systems and formal languages. J. ACM 35, 324–344 (1988)

    Article  MathSciNet  MATH  Google Scholar 

  • Messerschmidt, H., Otto, F.: Cooperating distributed systems of restarting automata. Int. J. Found. Comput. Sci. 18, 1333–1342 (2007)

    Article  MathSciNet  MATH  Google Scholar 

  • Messerschmidt, H., Otto, F.: On deterministic CD-systems of restarting automata. Int. J. Found. Comput. Sci. 20, 185–209 (2009)

    Article  MathSciNet  MATH  Google Scholar 

  • Nagy, B., Otto, F.: CD-systems of stateless deterministic R(1)-automata accept all rational trace languages. In: Dediu, A.H., Fernau, H., Martin-Vide, C. (eds.) LATA 2010, Proceedings. LNCS 6031, pp. 463–474. Springer, Berlin (2010)

  • Nagy, B., Otto, F.: An automata-theoretical characterization of context-free trace languages. In: Černá, I. et al. (eds.) SOFSEM 2011, Proceedings. LNCS 6543, pp. 406–417. Springer, Berlin (2011)

  • Nagy, B., Otto, F.: Finite-state acceptors with translucent letters. In: Bel-Enguix, G., Dahl, V., De La Puente, A.O. (eds.) BILC 2011, Proceedings, pp. 3–13. SciTePress, Portugal (2011)

  • Nagy, B., Otto, F.: Globally deterministic CD-systems of stateless R(1)-automata. In: Dediu, A., Inenaga, S., Martin-Vide, C. (eds.) LATA 2011, Proceedings. LNCS 6638, pp. 390–401. Springer, Berlin (2011)

  • Nagy, B., Otto, F.: Deterministic pushdown-CD-systems of stateless deterministic R(1)-automata. In: Dömösi, P., Iván, S. (eds.) Automata and Formal Languages, AFL 2011, Proceedings, pp. 328–342. Institute of Mathematics and Informatics, College of Nyiregyháza (2011)

  • Nagy, B., Otto, F.: CD-systems of stateless deterministic R(1)-automata governed by an external pushdown store. RAIRO Theor. Inform. Appl. 45, 413–448 (2011)

    Article  MathSciNet  MATH  Google Scholar 

  • Nagy, B., Otto, F.: On CD-systems of stateless deterministic R-automata with window size one. J. Comput. Syst. Sci. 78, 780–806 (2012)

    Article  MathSciNet  MATH  Google Scholar 

  • Niemann, G., Otto, F.: Further results on restarting automata. In: Ito, M., Imaoka, T. (eds.) Words, Languages and Combinatorics III, Proceedings, pp. 352–369. World Scientific, Singapore (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)

  • Sénizergues, G.: Church-Rosser controlled rewriting systems and equivalence problems for deterministic context-free languages. Inform. Comput. 81, 265–279 (1989)

    Article  MATH  Google Scholar 

  • Sénizergues, G.: Some decision problems about controlled rewriting systems. Theoret. Comput. Sci. 71, 281–346 (1990)

    Article  MathSciNet  MATH  Google Scholar 

  • Sgall, P., Nebeský, L., Gorlčíková, A., Hajičová, E.: A Functional Approach to Syntax in Generative Description of Language. American Elsevier Publishing Company, New York (1969)

    MATH  Google Scholar 

  • Taşdemir, N., Cem Say, A.C.: Models of pushdown automata with reset. In: Mauri, G., Leporati, A. (eds.) DLT 2011, Proceedings. LNCS 6795, pp. 417–428. Springer, Berlin (2011)

Download references

Author information

Authors and Affiliations

  1. Department of Computer Science, Faculty of Informatics, University of Debrecen, Egyetem tér 1., Debrecen, 4032, Hungary

    Benedek Nagy

  2. Fachbereich Elektrotechnik/Informatik, Universität Kassel, 34109 , Kassel, Germany

    Friedrich Otto

Authors
  1. Benedek Nagy
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Friedrich Otto
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Benedek Nagy.

Additional information

The results of this paper have been announced at the 13-th International Conference on Automata and Formal Languages, AFL 2011, in Debrecen, Hungary, August 2011. An extended abstract appeared in the proceedings of that conference [26].

B. Nagy was supported by the TÁMOP 4.2.1/B-09/1/KONV-2010-0007 and by the TÁMOP 4.2.2/C-11/1/KONV-2012-0001 projects that are implemented through the New Hungary Development Plan and have been supported by the European Union, co-financed by the European Social Fund.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Nagy, B., Otto, F. Deterministic pushdown-CD-systems of stateless deterministic R(1)-automata. Acta Informatica 50, 229–255 (2013). https://doi.org/10.1007/s00236-012-0175-x

Download citation

  • Received:

  • Accepted:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s00236-012-0175-x

Keywords

Search

Navigation