Hybrid tree automata and the yield theorem for constituent tree automata

DOI10.1007/978-3-031-07469-1_7OpenAlexW4285188060MaRDI QIDQ2164739

Richard Mörbitz, Frank Drewes, 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)

Related Items (1)

Hybrid tree automata and the yield theorem for constituent tree automata

Cites Work

• Unnamed Item
• Unnamed Item
• On multiple context-free grammars
• Tree acceptors and some of their applications
• Parsing Beyond Context-Free Grammars
• Bottom-up and top-down tree transformations— a comparison
• Tree generating regular systems

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