Deterministic stack transducers

DOI10.1007/978-3-319-40946-7_3MaRDI QIDQ2830204zbMATH OpenOpenAlexFDO

Authors Suna Bensch, Johanna Björklund, Martin Kutrib

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)

Recommendations

• Deterministic stack transducers
• scientific article; zbMATH DE number 4119634
• scientific article; zbMATH DE number 3885333
• scientific article; zbMATH DE number 4213435
• Tree-stack automata

Cites work

• scientific article; zbMATH DE number 5251101 (Why is no real title available?)
• A generalization of context-free determinism
• Limited automata and context-free languages
• Limited automata and regular languages
• On simulation cost of unary limited automata
• One-way stack automata
• Optimization of LR(k) parsers
• Reversible limited automata
• Sets accepted by one-way stack automata are context sensitive
• Stack automata and compiling

Cited in

(3)

• Input-Position-Restricted Models of Language Acceptors
• Deterministic stack transducers
• Transducing reversibly with finite state machines

This page was built for publication: Deterministic stack transducers

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2830204)