Deterministic Stack Transducers

DOI10.1007/978-3-319-40946-7_3zbMath1379.68215OpenAlexW2505505269MaRDI QIDQ2830204

Martin Kutrib, Suna Bensch, Johanna Björklund

Publication date: 9 November 2016

Published in: Implementation and Application of Automata (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-319-40946-7_3

Mathematics Subject Classification ID

Formal languages and automata (68Q45)

Related Items (2)

Input-Position-Restricted Models of Language Acceptors ⋮ Transducing reversibly with finite state machines

Cites Work

• Unnamed Item
• Optimization of LR(k) parsers
• Limited Automata and Context-Free Languages
• Reversible Limited Automata
• LIMITED AUTOMATA AND REGULAR LANGUAGES
• On Simulation Cost of Unary Limited Automata
• Stack automata and compiling
• A generalization of context-free determinism
• One-way stack automata
• Sets accepted by one-way stack automata are context sensitive

This page was built for publication: Deterministic Stack Transducers