Pages that link to "Item:Q1911400"
From MaRDI portal
The following pages link to Automata for reduction properties solving (Q1911400):
Displayed 15 items.
- Sufficient completeness verification for conditional and constrained TRS (Q420848) (← links)
- Rigid tree automata and applications (Q553317) (← links)
- Test sets for the universal and existential closure of regular tree languages. (Q1400712) (← links)
- The undecidability of the first-order theories of one step rewriting in linear canonical systems (Q1854538) (← links)
- Ground reducibility is EXPTIME-complete (Q1887142) (← links)
- Non-linear rewrite closure and weak normalization (Q2351264) (← links)
- Emptiness and finiteness for tree automata with global reflexive disequality constraints (Q2351395) (← links)
- Tree automata with equality constraints modulo equational theories (Q2426520) (← links)
- Tree automata for rewrite strategies (Q2456572) (← links)
- E-generalization using grammars (Q2457667) (← links)
- Tree Automata with Global Constraints (Q3533021) (← links)
- TREE AUTOMATA WITH GLOBAL CONSTRAINTS (Q3586405) (← links)
- Rigid Tree Automata (Q3618602) (← links)
- TAGED Approximations for Temporal Properties Model-Checking (Q3637350) (← links)
- The HOM Problem is EXPTIME-Complete (Q5895159) (← links)