Hybrid tree automata and the yield theorem for constituent tree automata

DOI10.1016/J.TCS.2023.114185OpenAlexW4386827433MaRDI QIDQ6057836

Richard Mörbitz, Frank Drewes, Heiko Vogler

Publication date: 26 October 2023

Published in: Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.tcs.2023.114185

zbMATH Keywords

hybrid treeconstituent treeconstituent tree automatahybrid tree automatalinear context-free rewriting system

Mathematics Subject Classification ID

Theory of computing (68Qxx)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• On multiple context-free grammars
• Hybrid tree automata and the yield theorem for constituent tree automata
• Tree acceptors and some of their applications
• Parsing Beyond Context-Free Grammars
• Logics and Automata for Totally Ordered Trees
• Tree generating regular systems

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