Deterministic Stack Transducers

DOI10.1142/S0129054117400081zbMath1380.68246OpenAlexW4248605269MaRDI QIDQ4605515

Johanna Björklund, Martin Kutrib, Suna Bensch

Publication date: 22 February 2018

Published in: International Journal of Foundations of Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1142/s0129054117400081

zbMATH Keywords

automata theorycomputational capacitystack transducers

Mathematics Subject Classification ID

Formal languages and automata (68Q45)

Related Items (7)

Space Complexity of Stack Automata Models ⋮ On store languages and applications ⋮ Tree-walking-storage automata ⋮ Reversible pushdown transducers ⋮ On store languages of language acceptors ⋮ Transducing reversibly with finite state machines ⋮ Space Complexity of Stack Automata Models

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Limited Automata and Context-Free Languages
• Reversible Limited Automata
• Transducers with Origin Information
• LIMITED AUTOMATA AND REGULAR LANGUAGES
• Intercalation theorems for stack languages
• On Simulation Cost of Unary Limited Automata
• Stack automata and compiling
• A generalization of context-free determinism
• One-way stack automata
• A Note on Pushdown Store Automata and Regular Systems
• Sets accepted by one-way stack automata are context sensitive

This page was built for publication: Deterministic Stack Transducers