Pages that link to "Item:Q2920139"
From MaRDI portal
The following pages link to On nondeterministic unranked tree automata with sibling constraints (Q2920139):
Displaying 8 items.
- The emptiness problem for tree automata with at least one global disequality constraint is NP-hard (Q344514) (← 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)
- Emptiness and finiteness for tree automata with global reflexive disequality constraints (Q2351395) (← links)
- Verifying quantitative temporal properties of procedural programs (Q5009429) (← links)
- A Characterisation of Pi^0_2 Regular Tree Languages (Q5111272) (← links)
- Unranked Tree Automata with Sibling Equalities and Disequalities (Q5428866) (← links)
- Projection for Büchi Tree Automata with Constraints between Siblings (Q5859646) (← links)