Abstract
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 context-free tree language and prove that its preimage under a certain linear tree homomorphism cannot be generated by any context-free tree grammar. However, the closure can be proved for the linear monadic context-free tree languages.
Cite
CITATION STYLE
Osterholzer, J., Dietze, T., & Herrmann, L. (2016). Linear context-free tree languages and inverse homomorphisms. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 9618, pp. 478–489). Springer Verlag. https://doi.org/10.1007/978-3-319-30000-9_37
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
