The following pages link to The HOM problem is decidable (Q2875176):
Displaying 10 items.
- Parameter reduction and automata evaluation for grammar-compressed trees (Q440015) (← links)
- Isomorphism of regular trees and words (Q1951601) (← links)
- Crossing the Syntactic Barrier: Hom-Disequalities for ${\mathcal H}_1$-Clauses (Q2914718) (← links)
- Tree Automata, (Dis-)Equality Constraints and Term Rewriting (Q3007653) (← links)
- Paths, tree homomorphisms and disequalities for -clauses (Q4961723) (← links)
- Projection for Büchi Tree Automata with Constraints between Siblings (Q5859646) (← links)
- The HOM Problem is EXPTIME-Complete (Q5892435) (← links)
- (Q6168448) (← links)
- Solving the Weighted HOM-Problem With the Help of Unambiguity (Q6204136) (← links)
- The weighted HOM-problem over fields (Q6671672) (← links)
