Transductions of dags and trees

DOI10.1007/BF01786981MaRDI QIDQ4742320zbMATH OpenFDO

Authors Tsutomu Kamimura, Giora Slutzki

Publication date 1982

Published in Mathematical Systems Theory (Search for Journal in Brave)

zbMATH Keywords

directed acyclic graphstree languagestransductionsphrase-structure grammarsdag languagesbottom-up dag-to-tree transducers

Mathematics Subject Classification ID

Formal languages and automata (68Q45)

Cites work

• scientific article; zbMATH DE number 3644512 (Why is no real title available?)
• scientific article; zbMATH DE number 3671715 (Why is no real title available?)
• scientific article; zbMATH DE number 3501022 (Why is no real title available?)
• Acceptors for the derivation languages of phrase-structure grammars
• Algebra automata I: Parallel programming as a prolegomena to the categorical approach
• Bottom-up and top-down tree transformations— a comparison
• Composition of top-down and bottom-up tree transductions
• Generalized Syntax Directed Translation, Tree Transducers, and Linear Space
• Generalized finite automata theory with an application to a decision problem of second-order logic
• Generalized sequential machine maps
• Mappings and grammars on trees
• On the computational power of pushdown automata
• On the syntactic structures of unrestricted grammars I. Generative grammars and phrase structure grammars
• Semantic preserving translations
• Top-down tree transducers with regular look-ahead
• Translations on a context free grammar
• Tree transducers, L systems, and two-way machines
• Tree transducers, \(L\) systems and two-way machines (extended abstract)

Cited in

(3)

• Graph Automata: The Algebraic Properties of Abelian Relational Graphoids
• Graph automata
• The ancestor width of grammars and languages

This page was built for publication: Transductions of dags and trees

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