I am trying to understand the Projection operation (linear tree homomorphism) and Cylindrification operation (inverse tree homomorphism) from the book. Linear Tree homomorphism is defined as follows: enter image description hereenter image description here

Inverse Homomorphism is defined here as follows: enter image description here With these two concepts defined, I try to use it to understand the following operations: enter image description here enter image description here enter image description here

Now, there arent any step by step examples of how to accomplish ith projection/ ith cylindrification in tree automata in the referenced book. I would be grateful if you could point me to other useful references for these operations. That said, there is one example for the first projection, which I am unable to parse: enter image description here How does one come up with the new set of transitions rules, and which symbol is being projected?


migrated from cstheory.stackexchange.com May 1 at 7:38

This question came from our site for theoretical computer scientists and researchers in related fields.

Your Answer

By clicking “Post Your Answer”, you agree to our terms of service, privacy policy and cookie policy

Browse other questions tagged or ask your own question.