The following pages link to Confluent string rewriting (Q3994922):
Displaying 36 items.
- The Knuth-Bendix algorithm and the conjugacy problem in monoids. (Q633198) (← links)
- Some undecidable termination problems for semi-Thue systems (Q673625) (← links)
- On weakly confluent monadic string-rewriting systems (Q685433) (← 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)
- Compositions with superlinear deterministic top-down tree transformations (Q1127541) (← links)
- Some experiments with a completion theorem prover (Q1186705) (← links)
- Note on compatible well orders on a free monoid (Q1188318) (← links)
- Contributions of Ronald V. Book to the theory of string-rewriting systems (Q1274982) (← links)
- Notes on equational theories of relations (Q1344844) (← links)
- Constrained many-to-one string editing with memory (Q1358830) (← links)
- The context-splittable normal form for Church-Rosser language systems. (Q1401938) (← links)
- Decision problems for semi-Thue systems with a few rules (Q1763707) (← links)
- Invariants and closures in the theory of rewrite systems (Q1815344) (← links)
- Homogeneous grammars with a reduced number of non-context-free products (Q1847383) (← links)
- Confluence problems for trace rewriting systems (Q1854457) (← links)
- The word problem for one-relation monoids: a survey (Q1982573) (← links)
- Non-finitely generated maximal subgroups of context-free monoids (Q2099288) (← links)
- On the word problem for special monoids (Q2163877) (← links)
- On prefixal one-rule string rewrite systems (Q2330116) (← links)
- On the word problem for free products of semigroups and monoids (Q2693366) (← links)
- A logspace solution to the word and conjugacy problem of generalized Baumslag-Solitar groups (Q2975255) (← links)
- The problem of deciding confluence on a given congruence class is tractable for finite special string-rewriting systems (Q4013403) (← links)
- A deterministic algorithm to decide if a finitely presented abelian monoid is cancellative (Q4370002) (← links)
- Algebra and automated deduction (Q4647540) (← links)
- Non-Looping String Rewriting (Q4718895) (← links)
- On confluence of one-rule trace-rewriting systems (Q4841768) (← links)
- Confluence of prefix-constrained rewrite systems (Q4993332) (← links)
- The isomorphism problem for finite extensions of free groups is in PSPACE (Q5002826) (← links)
- Decidability of confluence and termination of monadic term rewriting systems (Q5055767) (← links)
- A complete characterization of termination of 0p 1q→1r 0s (Q5055817) (← links)
- (Q5092405) (← links)
- Conditional semi-Thue systems for presenting monoids (Q5096810) (← links)
- On growing context-sensitive languages (Q5204308) (← links)
- MULTIPLICATION TABLES AND WORD-HYPERBOLICITY IN FREE PRODUCTS OF SEMIGROUPS, MONOIDS AND GROUPS (Q6065367) (← links)
- The power word problem in graph products (Q6580077) (← links)