Weighted Restarting Automata and Pushdown Relations

DOI10.1007/978-3-319-23021-4_18zbMath1465.68167OpenAlexW2296452689MaRDI QIDQ2947160

Norbert Hundeshagen, Friedrich Otto, Qichao Wang

Publication date: 22 September 2015

Published in: Algebraic Informatics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-319-23021-4_18

zbMATH Keywords

pushdown relationrestarting transducerweighted restarting automatonquasi-realtime pushdown relation

Mathematics Subject Classification ID

Formal languages and automata (68Q45) Algebraic theory of languages and automata (68Q70)

Related Items (4)

Weighted restarting automata and pushdown relations ⋮ A hierarchy of jumping restarting automata ⋮ Languages Accepted by Weighted Restarting Automata* ⋮ Weighted Restarting Automata as Language Acceptors

Cites Work

• Unnamed Item
• Transducing by observing length-reducing and painter rules
• Characterizing the Rational Functions by Restarting Transducers
• ON STATELESS TWO-PUSHDOWN AUTOMATA AND RESTARTING AUTOMATA
• Properties of Finite and Pushdown Transducers
• Restarting automata

This page was built for publication: Weighted Restarting Automata and Pushdown Relations