Visibly pushdown transducers with look-ahead

DOI10.1007/978-3-642-27660-6_21MaRDI QIDQ2891373zbMATH OpenOpenAlexFDO

Authors Emmanuel Filiot, Frédéric Servais

Publication date 15 June 2012

Published in SOFSEM 2012: Theory and Practice of Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-642-27660-6_21

Mathematics Subject Classification ID

Formal languages and automata (68Q45)

Recommendations

• Properties of visibly pushdown transducers
• Visibly pushdown transducers
• Expressiveness of visibly pushdown transducers
• Visibly pushdown transducers with well-nested outputs
• Visibly pushdown transducers with well-nested outputs

Cites work

• Adding nesting structure to words
• Decomposing Finite-Valued Transducers and Deciding Their Equivalence
• Equivalence of Deterministic Nested Word to Word Transducers
• scientific article; zbMATH DE number 3497806 (Why is no real title available?)
• Lexicographic decomposition of \(k\)-valued transducers
• Macro forest transducers
• Macro tree transducers
• On Relations Defined by Generalized Finite Automata
• On tree transducers for partial functions
• Properties of visibly pushdown transducers
• Queries on XML streams with bounded delay and concurrency
• Sur les rélations rationnelles entre monoides libres
• Top-down tree transducers with regular look-ahead
• Visibly pushdown languages
• Visibly Pushdown Transducers

Cited in

(6)

• Visibly pushdown transducers
• Colored nested words
• A simple method for building bimachines from functional finite-state transducers
• Properties of visibly pushdown transducers
• Expressiveness of visibly pushdown transducers
• Look-ahead removal for total deterministic top-down tree transducers

This page was built for publication: Visibly pushdown transducers with look-ahead

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