Pages that link to "Item:Q4927423"
From MaRDI portal
The following pages link to Decidable Classes of Tree Automata Mixing Local and Global Constraints Modulo Flat Theories (Q4927423):
Displaying 7 items.
- The emptiness problem for tree automata with at least one global disequality constraint is NP-hard (Q344514) (← links)
- On regular paths with counting and data tests (Q1744429) (← links)
- Emptiness and finiteness for tree automata with global reflexive disequality constraints (Q2351395) (← links)
- Parameterized complexity of basic decision problems for tree automata (Q2855747) (← links)
- (Q5090498) (← links)
- Projection for Büchi Tree Automata with Constraints between Siblings (Q5859646) (← links)
- The HOM Problem is EXPTIME-Complete (Q5895159) (← links)
