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 that words over a given (output) alphabet are assigned as weights to the transitions of a restarting automaton. In this way the automaton is extended...

Ausführliche Beschreibung

Bibliographische Detailangaben

Veröffentlicht in:	Theoretical computer science 2016-07, Vol.635, p.1-15
Hauptverfasser:	Wang, Qichao, Otto, Friedrich
Format:	Artikel
Sprache:	eng
Schlagworte:	Almost-realtime pushdown relation Alphabets Languages Mathematical analysis Mathematical models Pushdown relation Restarting Restarting transducer Rings (mathematics) Symbols Transducers Weighted restarting automaton
Online-Zugang:	Volltext
Tags:	Tag hinzufügen Keine Tags, Fügen Sie den ersten Tag hinzu!