Transduction from trees to graphs through folding

DOI10.1016/j.ic.2023.105111MaRDI QIDQ6145530

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

Publication date: 2 February 2024

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

zbMATH Keywords

graphstreessemantic representationstranducers

Mathematics Subject Classification ID

Theory of computing (68Qxx)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• The equivalence of bottom-up and top-down tree-to-graph transducers
• Monadic second-order definable graph transductions: a survey
• Tree-based picture generation
• Tree-to-graph transductions with scope
• Rule-based top-down parsing for acyclic contextual hyperedge replacement grammars
• Z-automata for compact and direct representation of unranked tree languages
• Extending predictive shift-reduce parsing to contextual hyperedge replacement grammars
• Uniform parsing for hyperedge replacement grammars
• Between a Rock and a Hard Place – Uniform Parsing for Hyperedge Replacement DAG Grammars
• Bottom-up and top-down tree transformations— a comparison
• Top-down tree transducers with regular look-ahead
• Tree transducers and tree languages
• Fitting probabilistic automata via the em algorithm