Advertisement

CD-Systems of Stateless Deterministic R(1)-Automata Accept All Rational Trace Languages

  • Benedek Nagy
  • Friedrich Otto
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 6031)

Abstract

We study cooperating distributed systems (CD-systems) of restarting automata that are very restricted: they are deterministic, they cannot rewrite, but only delete symbols, they restart immediately after performing a delete operation, they are stateless, and they have a read/write window of size 1 only, that is, these are stateless deterministic R(1)-automata. We relate the class of languages that are accepted by mode = 1 computations of CD-systems of such automata to other well-studied language classes, showing in particular that it only consists of semi-linear languages, and that it includes all rational trace languages.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. 1.
    Berstel, J.: Transductions and Context-free Languages. In: Teubner Studienbücher: Informatik. Teubner, Stuttgart (1979)Google Scholar
  2. 2.
    Csuhaj-Varjú, E., Martín-Vide, C., Mitrana, V.: Multiset automata. In: Calude, C., Păun, G., Rozenberg, G., Salomaa, A. (eds.) Multiset Processing. LNCS, vol. 2235, pp. 69–83. Springer, Heidelberg (2001)CrossRefGoogle Scholar
  3. 3.
    Diekert, V., Rozenberg, G.: The Book of Traces. World Scientific, Singapore (1995)Google Scholar
  4. 4.
    Kutrib, M., Messerschmidt, H., Otto, F.: On stateless two-pushdown automata and restarting automata. In: Csuhaj-Varjú, E., Ésik, Z. (eds.) Automata and Formal Languages, AFL 2008, Proc. Computer and Automation Research Institute, pp. 257–268. Hungarian Academy of Sciences (2008)Google Scholar
  5. 5.
    Kutrib, M., Messerschmidt, H., Otto, F.: On stateless two-pushdown automata and restarting automata. Intern. J. Found. Comput. Sci (to appear, 2010); Extended version of [4]Google Scholar
  6. 6.
    Messerschmidt, H., Otto, F.: Cooperating distributed systems of restarting automata. Intern. J. Found. Comput. Sci. 18, 1333–1342 (2007)zbMATHCrossRefMathSciNetGoogle Scholar
  7. 7.
    Messerschmidt, H., Otto, F.: On deterministic CD-systems of restarting automata. Intern. J. Found. Comput. Sci. 20, 185–209 (2009)zbMATHCrossRefMathSciNetGoogle Scholar
  8. 8.
    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)Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2010

Authors and Affiliations

  • Benedek Nagy
    • 1
  • Friedrich Otto
    • 2
  1. 1.Department of Computer Science, Faculty of InformaticsUniversity of DebrecenHungary
  2. 2.Fachbereich Elektrotechnik/InformatikUniversität KasselKasselGermany

Personalised recommendations