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…