Pages that link to "Item:Q4933333"
From MaRDI portal
The following pages link to Bottom-Up Tree Automata with Term Constraints (Q4933333):
Displaying 14 items.
- The emptiness problem for tree automata with at least one global disequality constraint is NP-hard (Q344514) (← links)
- Finite tree automata with cost functions (Q1325851) (← links)
- Solving a unification problem under constrained substitutions using tree automata (Q1355760) (← links)
- Projection for Büchi tree automata with constraints between siblings (Q1622997) (← links)
- Extending \(H_1\)-clauses with disequalities (Q1944188) (← links)
- Crossing the Syntactic Barrier: Hom-Disequalities for ${\mathcal H}_1$-Clauses (Q2914718) (← links)
- On nondeterministic unranked tree automata with sibling constraints (Q2920139) (← links)
- (Q3113675) (← links)
- Visibly Tree Automata with Memory and Constraints (Q3518284) (← links)
- Automated Induction with Constrained Tree Automata (Q3541728) (← links)
- Paths, tree homomorphisms and disequalities for -clauses (Q4961723) (← links)
- (Q4994129) (← links)
- Encompassment properties and automata with constraints (Q5055805) (← links)
- Projection for Büchi Tree Automata with Constraints between Siblings (Q5859646) (← links)