Pages that link to "Item:Q3586405"

The following pages link to TREE AUTOMATA WITH GLOBAL CONSTRAINTS (Q3586405):

Displaying 8 items.

• The emptiness problem for tree automata with at least one global disequality constraint is NP-hard (Q344514) (← links)
• Parameter reduction and automata evaluation for grammar-compressed trees (Q440015) (← 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)
• Tree Automata, (Dis-)Equality Constraints and Term Rewriting (Q3007653) (← links)
• (Q5090498) (← links)
• Projection for Büchi Tree Automata with Constraints between Siblings (Q5859646) (← links)
• The HOM Problem is EXPTIME-Complete (Q5895159) (← links)