Pages that link to "Item:Q1067781"

The following pages link to A note on a special one-rule semi-Thue system (Q1067781):

Displaying 19 items.

• Using string-rewriting for solving the word problem for finitely presented groups (Q580494) (← 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)
• n-level rewriting systems (Q1084855) (← links)
• Commutative monoids have complete presentations by free (non-commutative) monoids (Q1085284) (← links)
• Complete semi-Thue systems for abelian groups (Q1087012) (← links)
• On deciding the confluence of a finite string-rewriting system on a given congruence class (Q1102946) (← links)
• Word problems and a homological finiteness condition for monoids (Q1105040) (← links)
• Pseudo-natural algorithms for finitely generated presentations of monoids and groups (Q1115973) (← links)
• Relating rewriting techniques on monoids and rings: congruences on monoids and ideals in monoid rings (Q1275014) (← links)
• Rewriting systems of Coxeter groups (Q1321036) (← links)
• The word problem for one-relation monoids: a survey (Q1982573) (← links)
• Convergent presentations and polygraphic resolutions of associative algebras (Q2272945) (← links)
• On prefixal one-rule string rewrite systems (Q2330116) (← links)
• Finite derivation type for Rees matrix semigroups (Q2368998) (← links)
• Polygraphs of finite derivation type (Q3130298) (← links)
• Finite canonical rewriting systems for congruences generated by concurrency relations (Q3779772) (← links)
• Church-Rooser property and homology of monoids (Q4006234) (← links)
• Restrictions of congruences generated by finite canonical string-rewriting systems (Q5055732) (← links)