The following pages link to Thue systems as rewriting systems (Q1099642):
Displaying 44 items.
- Undecidability of ground reducibility for word rewriting systems with variables (Q674184) (← links)
- A decision algorithm for linear sentences on a PFM (Q685065) (← links)
- On weakly confluent monadic string-rewriting systems (Q685433) (← links)
- Some decision problems about controlled rewriting systems (Q910246) (← links)
- About the descriptive power of certain classes of finite string-rewriting systems (Q910850) (← links)
- Decision problems for finite special string-rewriting systems that are confluent on some congruence class (Q912986) (← links)
- A characterisation of deterministic context-free languages by means of right-congruences (Q913524) (← links)
- A public key cryptosystem based on Lyndon words (Q918715) (← links)
- Complexity, combinatorial group theory and the language of palutators (Q1105698) (← links)
- Deterministic tree pushdown automata and monadic tree rewriting systems (Q1118421) (← links)
- Some polynomial-time algorithms for finite monadic Church-Rosser Thue systems (Q1123619) (← links)
- On the descriptive power of special Thue systems (Q1126309) (← links)
- Conjugacy in special monoids (Q1178900) (← links)
- A criterion for proving noetherianity of a relation (Q1186611) (← links)
- Word problem in free clumps (Q1190471) (← links)
- Simulation of Turing machines by a regular rewrite rule (Q1199548) (← links)
- Some properties of finite special string-rewriting systems (Q1201349) (← links)
- A field guide to equational logic (Q1201350) (← links)
- The pre-NTS property is undecidable for context-free grammars (Q1208437) (← links)
- Semigroups presented by one relation and satisfying the Church-Rosser property (Q1274007) (← links)
- Contributions of Ronald V. Book to the theory of string-rewriting systems (Q1274982) (← links)
- Synchronization expressions with extended join operation (Q1274985) (← links)
- On minimizing the \(\forall\)-\(\neg\) degree of a connective-free formula (Q1323356) (← links)
- Bottom-up tree pushdown automata: Classification and connection with rewrite systems (Q1325836) (← links)
- Weights for total division orderings on strings (Q1346630) (← links)
- Cancellativity in finitely presented semigroups (Q1824041) (← links)
- The word problem for one-relation monoids: a survey (Q1982573) (← links)
- It is decidable whether a monadic thue system is canonical over a regular set (Q3210188) (← links)
- Time-bounded controlled bidirectional grammars (Q3477981) (← links)
- Using groups for investigating rewrite systems (Q3545275) (← links)
- The problem of deciding confluence on a given congruence class is tractable for finite special string-rewriting systems (Q4013403) (← links)
- Structural Monoids Associated to Equational Varieties (Q4038360) (← links)
- Church-Rosser codes (Q4608513) (← links)
- SOME EXACT SEQUENCES FOR THE HOMOTOPY (BI-)MODULE OF A MONOID (Q4786319) (← links)
- Simulation of Turing machines by a left-linear rewrite rule (Q5055715) (← links)
- An equational logic sampler (Q5055725) (← links)
- Restrictions of congruences generated by finite canonical string-rewriting systems (Q5055732) (← links)
- Decidability of confluence and termination of monadic term rewriting systems (Q5055767) (← links)
- Bottom-up tree pushdown automata and rewrite systems (Q5055768) (← links)
- On some algorithmic problems for groups and monoids (Q5055802) (← links)
- Applying rewriting methods to special monoids (Q5288344) (← links)
- Semigroups satisfying x m+n = x n (Q5881194) (← links)
- Trace rewriting systems (Q5881198) (← links)
- On public-key cryptosystem based on Church-Rosser string-rewriting systems (Q6064030) (← links)
