The following pages link to (Q4260705):
Displaying 7 items.
- Recognizable tree-languages and nonlinear morphisms (Q1603692) (← links)
- Projection for Büchi tree automata with constraints between siblings (Q1622997) (← links)
- Closure of Tree Automata Languages under Innermost Rewriting (Q5170159) (← links)
- Classes of Tree Homomorphisms with Decidable Preservation of Regularity (Q5458355) (← links)
- Projection for Büchi Tree Automata with Constraints between Siblings (Q5859646) (← links)
- The HOM Problem is EXPTIME-Complete (Q5895159) (← links)
- Grid structures and undecidable constraint theories (Q5941204) (← links)