Weighted Restarting Automata and Pushdown Relations

  • Qichao Wang
  • Norbert Hundeshagen
  • Friedrich OttoEmail author
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 9270)


Weighted restarting automata have been introduced to study quantitative aspects of computations of restarting automata. Here we study the special case of assigning words as weights from the semiring of formal languages over a given (output) alphabet, in this way generalizing the restarting transducers introduced by Hundeshagen (2013). We obtain several new classes of word relations in terms of restarting automata, which we relate to various types of pushdown relations.


Weighted restarting automaton Restarting transducer Pushdown relation Quasi-realtime pushdown relation 


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. 1.
    Aho, A.V., Ullman, J.D.: The Theory of Parsing, Translation, and Compiling. Prentice-Hall Inc., Upper Saddle River (1972)Google Scholar
  2. 2.
    Choffrut, C., Culik II, K.: Properties of Finite and Pushdown Transducers. SIAM J. Comput. 12(2), 300–315 (1983)zbMATHMathSciNetCrossRefGoogle Scholar
  3. 3.
    Hundeshagen, N.: Relations and Transductions Realized by Restarting Automata. Ph.D. thesis, Fachbereich Elektrotechnik/Informatik, Universität Kassel (2013)Google Scholar
  4. 4.
    Hundeshagen, N., Leupold, P.: Transducing by observing and restarting transducers. In: Freund, R., Holzer, M., Truthe, B., Ultes-Nitsche, U. (eds.) NCMA 2012., vol. 290, pp. 93–106. Österreichische Computer Gesellschaft, Vienna (2012)Google Scholar
  5. 5.
    Hundeshagen, N., Leupold, P.: Transducing by Observing Length-Reducing and Painter Rules. RAIRO - Theor. Inform. Appl. 48(1), 85–105 (2014)zbMATHMathSciNetCrossRefGoogle Scholar
  6. 6.
    Hundeshagen, N., Otto, F.: Characterizing the rational functions by restarting transducers. In: Dediu, A.-H., Martín-Vide, C. (eds.) LATA 2012. LNCS, vol. 7183, pp. 325–336. Springer, Heidelberg (2012) CrossRefGoogle Scholar
  7. 7.
    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) CrossRefGoogle Scholar
  8. 8.
    Jančar, P., Mráz, F., Plátek, M., Vogel, J.: On Monotonic Automata with a Restart Operation. J. Auto. Lang. Comb. 4(4), 287–312 (1999)zbMATHGoogle Scholar
  9. 9.
    Kutrib, M., Messerschmidt, H., Otto, F.: On Stateless Two-Pushdown Automata and Restarting Automata. Int. J. Found. Comp. Sci. 21, 781–798 (2010)zbMATHMathSciNetCrossRefGoogle Scholar
  10. 10.
    Otto, F., Wang, Q.: Weighted Restarting Automata. The results of this paper have been announced at WATA 2014 in Leipzig, May 2014 (submitted)Google Scholar

Copyright information

© Springer International Publishing Switzerland 2015

Authors and Affiliations

  • Qichao Wang
    • 1
  • Norbert Hundeshagen
    • 1
  • Friedrich Otto
    • 1
    Email author
  1. 1.Fachbereich Elektrotechnik/InformatikUniversität KasselKasselGermany

Personalised recommendations