Hybrid tree automata and the yield theorem for constituent tree automata

DOI10.1007/978-3-031-07469-1_7MaRDI QIDQ2164739zbMATH OpenOpenAlexFDO

Authors Frank Drewes, Richard Mörbitz, Heiko Vogler

Publication date 16 August 2022

Full work available at URL https://doi.org/10.1007/978-3-031-07469-1_7

Mathematics Subject Classification ID

Formal languages and automata (68Q45)

Cites work

• Bottom-up and top-down tree transformations— a comparison
• scientific article; zbMATH DE number 3854429 (Why is no real title available?)
• On multiple context-free grammars
• Parsing beyond context-free grammars
• The mathematics of language
• Tree acceptors and some of their applications
• Tree generating regular systems

Cited in

(3)

• Hybrid tree automata and the yield theorem for constituent tree automata
• Sweeping permutation automata
• Constituency parsing as an instance of the M-monoid parsing problem

This page was built for publication: Hybrid tree automata and the yield theorem for constituent tree automata

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