Toni Dietze

We don’t have enough information about this author to calculate their statistics. If you think this is an error let us know.
Learn More
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. A positive result can still be(More)
  • 1