Pages that link to "Item:Q918215"
From MaRDI portal
The following pages link to Decidability of the confluence of finite ground term rewrite systems and of other related term rewrite systems (Q918215):
Displayed 17 items.
- Verification of well-formed communicating recursive state machines (Q944388) (← links)
- Reachability and confluence are undecidable for flat term rewriting systems (Q1014436) (← links)
- Linear generalized semi-monadic rewrite systems effectively preserve recognizability (Q1127543) (← links)
- A fast algorithm for constructing a tree automaton recognizing a congruential tree language (Q1261478) (← links)
- Bottom-up tree pushdown automata: Classification and connection with rewrite systems (Q1325836) (← links)
- Monadic second-order definable graph transductions: a survey (Q1325847) (← links)
- Intersection of finitely generated congruences over term algebra (Q1399965) (← links)
- Term rewriting restricted to ground terms. (Q1401322) (← links)
- On ground tree transformations and congruences induced by tree automata. (Q1401416) (← links)
- Congruential complements of ground term rewrite systems (Q1575250) (← links)
- Decidability and complexity of simultaneous rigid E-unification with one variable and related results (Q1575636) (← links)
- Restricted ground tree transducers (Q1589437) (← links)
- Decidable call-by-need computations in term rewriting (Q1763429) (← links)
- Derivation trees of ground term rewriting systems. (Q1854289) (← links)
- Deciding confluence of certain term rewriting systems in polynomial time (Q1886319) (← links)
- The Reachability Problem over Infinite Graphs (Q3392937) (← links)
- The $\Pi^0_2$ -Completeness of Most of the Properties of Rewriting Systems You Care About (and Productivity) (Q3636833) (← links)