Pages that link to "Item:Q1887142"
From MaRDI portal
The following pages link to Ground reducibility is EXPTIME-complete (Q1887142):
Displaying 10 items.
- Sufficient completeness verification for conditional and constrained TRS (Q420848) (← links)
- Proving weak properties of rewriting (Q554217) (← links)
- Reducibility of operation symbols in term rewriting systems and its application to behavioral specifications (Q968529) (← links)
- Test sets for the universal and existential closure of regular tree languages. (Q1400712) (← links)
- Induction = I-axiomatization + first-order consistency. (Q1854350) (← links)
- Specification and proof in membership equational logic (Q1978640) (← links)
- A proof method for local sufficient completeness of term rewriting systems (Q2119990) (← links)
- Non-linear rewrite closure and weak normalization (Q2351264) (← links)
- Emptiness and finiteness for tree automata with global reflexive disequality constraints (Q2351395) (← links)
- Alternating two-way AC-tree automata (Q2373699) (← links)
