Pages that link to "Item:Q1073016"
From MaRDI portal
The following pages link to A finite Thue system with decidable word problem and without equivalent finite canonical system (Q1073016):
Displayed 37 items.
- Higher-dimensional normalisation strategies for acyclicity (Q456807) (← links)
- Using string-rewriting for solving the word problem for finitely presented groups (Q580494) (← links)
- A finitely presented monoid which has solvable word problem but has no regular complete presentation (Q673144) (← links)
- On weakly confluent monadic string-rewriting systems (Q685433) (← links)
- Finite complete rewriting systems and the complexity of word problem (Q791314) (← 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)
- On ground-confluence of term rewriting systems (Q913496) (← links)
- Complete rewriting systems and homology of monoid algebras (Q923133) (← links)
- Pseudo-natural algorithms for the word problem for finitely presented monoids and groups (Q1074716) (← links)
- On sufficient-completeness and related properties of term rewriting systems (Q1077161) (← 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)
- Thue systems as rewriting systems (Q1099642) (← links)
- On deciding the confluence of a finite string-rewriting system on a given congruence class (Q1102946) (← links)
- Pseudo-natural algorithms for finitely generated presentations of monoids and groups (Q1115973) (← links)
- Finite derivation type for semi-direct products of monoids (Q1127330) (← links)
- Schematization of infinite sets of rewrite rules generated by divergent completion processes (Q1262755) (← links)
- Relating rewriting techniques on monoids and rings: congruences on monoids and ideals in monoid rings (Q1275014) (← links)
- A result on braids via the investigation of a rewriting system. (Q1426138) (← links)
- Convergent presentations and polygraphic resolutions of associative algebras (Q2272945) (← links)
- Finite derivation type for Rees matrix semigroups (Q2368998) (← links)
- Reduction operators and completion of rewriting systems (Q2399863) (← links)
- Algebra and geometry of rewriting (Q2463397) (← links)
- Polygraphs of finite derivation type (Q3130298) (← links)
- Finite canonical rewriting systems for congruences generated by concurrency relations (Q3779772) (← links)
- A decidable word problem without equivalent canonical term rewriting system (Q3816049) (← links)
- Church-Rooser property and homology of monoids (Q4006234) (← links)
- Restrictions of congruences generated by finite canonical string-rewriting systems (Q5055732) (← links)
- Any ground associative-commutative theory has a finite canonical system (Q5055779) (← links)
- Conditional semi-Thue systems for presenting monoids (Q5096810) (← links)
- (Q5111315) (← links)
- Coherent presentations of Artin monoids (Q5259734) (← links)
- Could orders be captured by term rewriting systems? (Q5881195) (← links)
- Syntactical methods for braids of three strands (Q5938545) (← links)
- Confluence of one-rule Thue systems (Q6114514) (← links)