Weighted restarting automata and pushdown relations

DOI10.1016/J.TCS.2016.04.038zbMath1454.68063OpenAlexW2379555353MaRDI QIDQ287429

Qichao Wang, Friedrich Otto

Publication date: 26 May 2016

Published in: Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.tcs.2016.04.038

zbMATH Keywords

almost-realtime pushdown relationpushdown relationrestarting transducerweighted restarting automaton

Mathematics Subject Classification ID

Formal languages and automata (68Q45)

Related Items (2)

A hierarchy of jumping restarting automata ⋮ Languages Accepted by Weighted Restarting Automata*

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Growing context-sensitive languages and Church-Rosser languages
• Properties of syntax directed translations
• Weighted Restarting Automata as Language Acceptors
• Characterizing the Rational Functions by Restarting Transducers
• Weighted Restarting Automata and Pushdown Relations
• ON STATELESS TWO-PUSHDOWN AUTOMATA AND RESTARTING AUTOMATA
• Properties of Finite and Pushdown Transducers
• Restarting automata
• Restarting automata with auxiliary symbols restricted by lookahead size
• Quasi-realtime languages

This page was built for publication: Weighted restarting automata and pushdown relations