Weighted restarting automata and pushdown relations
From MaRDI portal
Publication:287429
DOI10.1016/J.TCS.2016.04.038zbMATH Open1454.68063OpenAlexW2379555353MaRDI QIDQ287429FDOQ287429
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
Recommendations
almost-realtime pushdown relationpushdown relationrestarting transducerweighted restarting automaton
Cites Work
- Title not available (Why is that?)
- 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
- Title not available (Why is that?)
- Title not available (Why is that?)
- Restarting automata
- Restarting automata with auxiliary symbols restricted by lookahead size
- Quasi-realtime languages
Cited In (4)
This page was built for publication: Weighted restarting automata and pushdown relations
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q287429)