A uniformization theorem for nested word to word transductions

DOI10.1007/978-3-642-39274-0_10MaRDI QIDQ5327486zbMATH OpenOpenAlexFDO

Authors Rupak Majumdar, Dmitry Chistikov

Publication date 7 August 2013

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

Full work available at URL https://doi.org/10.1007/978-3-642-39274-0_10

zbMATH Keywords

uniformizationtransductionvisibly pushdown languagenested word

Mathematics Subject Classification ID

Formal languages and automata (68Q45)

Recommendations

• scientific article; zbMATH DE number 6741931
• scientific article; zbMATH DE number 7376069
• Uniformization problems for tree-automatic relations and top-down tree transducers
• Uniformisation of two-way transducers
• Equivalence of Deterministic Nested Word to Word Transducers

Cited in

(7)

• Uniquely decodable n-gram embeddings
• GENERIC ∊-REMOVAL AND INPUT ∊-NORMALIZATION ALGORITHMS FOR WEIGHTED TRANSDUCERS
• Representation and uniformization of algebraic transductions
• State complexity of operations on input-driven pushdown automata
• Logics for word transductions with synthesis
• Uniformizing rational relations for natural language applications using weighted determinization
• Visibly pushdown transducers

This page was built for publication: A uniformization theorem for nested word to word transductions

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