Z-automata for compact and direct representation of unranked tree languages

DOI10.1007/978-3-030-23679-3_7zbMATH Open1434.68233OpenAlexW2955357496MaRDI QIDQ2177601FDOQ2177601

Authors: Johanna Björklund, Frank Drewes, Giorgio Satta 

Publication date: 6 May 2020

Full work available at URL: https://doi.org/10.1007/978-3-030-23679-3_7

Recommendations

• Database Programming Languages
• Fundamentals of Computation Theory
• Tree automata
• Unranked Tree Automata with Sibling Equalities and Disequalities
• DAG automata for meaning representation

Mathematics Subject Classification ID

Formal languages and automata (68Q45) Analysis of algorithms and problem complexity (68Q25)

Cited In (3)

• Transduction from trees to graphs through folding
• Bottom-up unranked tree-to-graph transducers for translation into semantic graphs
• Parsing unranked tree languages, folded once

This page was built for publication: Z-automata for compact and direct representation of unranked tree languages

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