Weighted Restarting Automata and Pushdown Relations
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.
KeywordsWeighted restarting automaton Restarting transducer Pushdown relation Quasi-realtime pushdown relation
Unable to display preview. Download preview PDF.
- 1.Aho, A.V., Ullman, J.D.: The Theory of Parsing, Translation, and Compiling. Prentice-Hall Inc., Upper Saddle River (1972)Google Scholar
- 3.Hundeshagen, N.: Relations and Transductions Realized by Restarting Automata. Ph.D. thesis, Fachbereich Elektrotechnik/Informatik, Universität Kassel (2013)Google Scholar
- 4.Hundeshagen, N., Leupold, P.: Transducing by observing and restarting transducers. In: Freund, R., Holzer, M., Truthe, B., Ultes-Nitsche, U. (eds.) NCMA 2012. email@example.com, vol. 290, pp. 93–106. Österreichische Computer Gesellschaft, Vienna (2012)Google Scholar
- 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