Transduction from trees to graphs through folding

DOI10.1016/J.IC.2023.105111MaRDI QIDQ6145530zbMATH OpenFDO

Authors Martin Berglund, Henrik Björklund, Johanna Björklund, Adrien Boiret

Publication date 2 February 2024

Published in Information and Computation (Search for Journal in Brave)

Copyright license Creative Commons Attribution-NonCommercial-NoDerivatives 4.0 International

Full work available at URL https://doi.org/10.1016/J.IC.2023.105111

zbMATH Keywords

graphssemantic representationstranducerstrees

Mathematics Subject Classification ID

Theory of computing (68Qxx)

Recommendations

• Tree-to-graph transductions with scope
• Parsing unranked tree languages, folded once
• Bottom-up unranked tree-to-graph transducers for translation into semantic graphs
• scientific article; zbMATH DE number 475423
• The use of tree transducers to compute translations between graph algebras

Cites work

• Acyclic Contextual Hyperedge Replacement: Decidability of Acyclicity and Generative Power
• Between a rock and a hard place -- uniform parsing for hyperedge replacement DAG grammars
• Bottom-up and top-down tree transformations— a comparison
• Extending predictive shift-reduce parsing to contextual hyperedge replacement grammars
• Fitting probabilistic automata via the em algorithm
• scientific article; zbMATH DE number 3644524 (Why is no real title available?)
• scientific article; zbMATH DE number 177454 (Why is no real title available?)
• scientific article; zbMATH DE number 3639144 (Why is no real title available?)
• Monadic second-order definable graph transductions: a survey
• Rule-based top-down parsing for acyclic contextual hyperedge replacement grammars
• The equivalence of bottom-up and top-down tree-to-graph transducers
• Top-down tree transducers with regular look-ahead
• Tree transducers and tree languages
• Tree-based picture generation
• Tree-to-graph transductions with scope
• Uniform parsing for hyperedge replacement grammars
• Z-automata for compact and direct representation of unranked tree languages

Cited in

(1)

• Parsing unranked tree languages, folded once

This page was built for publication: Transduction from trees to graphs through folding

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