The following pages link to (Q5286134):
Displaying 5 items.
- A complete rewriting system for a monoid of tree transformation classes (Q918216) (← links)
- The emptiness problem is undecidable for domains of partial monadic 2- modular tree transformations (Q918726) (← links)
- A complete description for a monoid of deterministic bottom-up tree transformation classes (Q1177164) (← links)
- Classes of Tree Homomorphisms with Decidable Preservation of Regularity (Q5458355) (← links)
- Over Which Monoids is the Transducer Determinization Procedure Applicable? (Q5739012) (← links)