Pages that link to "Item:Q918215"

The following pages link to Decidability of the confluence of finite ground term rewrite systems and of other related term rewrite systems (Q918215):

Displaying 42 items.

• Symbol different term rewrite systems (Q492918) (← links)
• Levels of undecidability in rewriting (Q627134) (← links)
• Bottom-up rewriting for words and terms (Q741256) (← links)
• CHAP and rewrite components (Q766175) (← links)
• On ground-confluence of term rewriting systems (Q913496) (← links)
• Verification of well-formed communicating recursive state machines (Q944388) (← links)
• Reachability and confluence are undecidable for flat term rewriting systems (Q1014436) (← links)
• The Church-Rosser property for ground term-rewriting systems is decidable (Q1100890) (← 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)
• On deciding confluence of finite string-rewriting systems modulo partial commutativity (Q1262758) (← 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)
• Characterizing confluence by rewrite closure and right ground term rewrite systems (Q1885352) (← links)
• Deciding confluence of certain term rewriting systems in polynomial time (Q1886319) (← links)
• Path resolution for nested recursive modules (Q1929336) (← links)
• Rewriting higher-order stack trees (Q2411043) (← links)
• Decidability of termination of grid string rewriting rules (Q2784496) (← 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)
• Finite canonical rewriting systems for congruences generated by concurrency relations (Q3779772) (← links)
• Handling Left-Quadratic Rules When Completing Tree Automata (Q4982086) (← links)
• Fair termination is decidable for ground systems (Q5055739) (← links)
• Decidability of confluence and termination of monadic term rewriting systems (Q5055767) (← links)
• Open problems in rewriting (Q5055780) (← links)
• More problems in rewriting (Q5055812) (← links)
• Problems in rewriting III (Q5055847) (← links)
• Decidable approximations of term rewriting systems (Q5055873) (← links)
• New Undecidability Results for Properties of Term Rewrite Systems (Q5166638) (← links)
• Decidable call by need computations in term rewriting (extended abstract) (Q5234682) (← links)
• RIGID REACHABILITY, THE NON-SYMMETRIC FORM OF RIGID E-UNIFICATION (Q5249028) (← links)
• Ground Confluence Prover based on Rewriting Induction (Q5369498) (← links)
• Foundations of Software Science and Computational Structures (Q5705906) (← links)
• First-order theory of rewriting for linear variable-separated rewrite systems: automation, formalization, certification (Q6103588) (← links)