7 citations · 7 across the 1 of their papers we have counts for
Showing cs.FLShow all
2 papers · 1 filter
cs.FL2017★ 7 cited
Weighted Regular Tree Grammars with Storage
Zoltán Fülöp, Luisa Herrmann, Heiko Vogler
We introduce weighted regular tree grammars with storage as combination of (a) regular tree grammars with storage and (b) weighted tree automata over multioperator monoids. Each we…
cs.FL2015
Linear Context-Free Tree Languages and Inverse Homomorphisms
Johannes Osterholzer, Toni Dietze, Luisa Herrmann
We prove that the class of linear context-free tree languages is not closed under inverse linear tree homomorphisms. The proof is by contradiction: we encode Dyck words into a cont…