Pages that link to "Item:Q1256061"
From MaRDI portal
The following pages link to Presentations of groups and monoids (Q1256061):
Displaying 29 items.
- Verifying nilpotence (Q580975) (← 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)
- 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)
- Word problems over traces which are solvable in linear time (Q914395) (← links)
- Commutative monoids have complete presentations by free (non-commutative) monoids (Q1085284) (← links)
- A catalogue of complete group presentations (Q1097968) (← links)
- Some polynomial-time algorithms for finite monadic Church-Rosser Thue systems (Q1123619) (← links)
- When is an extension of a specification consistent? Decidable and undecidable cases (Q1186708) (← links)
- The use of Knuth-Bendix methods to solve the word problem in automatic groups (Q1192222) (← links)
- The Knuth-Bendix procedure for strings as a substitute for coset enumeration (Q1192226) (← links)
- On the Knuth-Bendix completion for concurrent processes (Q1262753) (← links)
- On deciding confluence of finite string-rewriting systems modulo partial commutativity (Q1262758) (← links)
- Relating rewriting techniques on monoids and rings: congruences on monoids and ideals in monoid rings (Q1275014) (← links)
- The word problem for groups with regular relations. Improvement of the Knuth-Bendix algorithm (Q1328892) (← links)
- Enumeration of double cosets (Q1837275) (← links)
- Infinite complete group presentations (Q1916428) (← links)
- On finite presentations of inverse semigroups with zero having polynomial growth (Q2334423) (← links)
- Stallings graphs for quasi-convex subgroups (Q2401628) (← links)
- The problem of deciding confluence on a given congruence class is tractable for finite special string-rewriting systems (Q4013403) (← links)
- Algebra and automated deduction (Q4647540) (← links)
- Automatic Groups Associated with Word Orders Other than Shortlex (Q4704557) (← links)
- SOME EXACT SEQUENCES FOR THE HOMOTOPY (BI-)MODULE OF A MONOID (Q4786319) (← links)
- GROWTH OF REES QUOTIENTS OF FREE INVERSE SEMIGROUPS DEFINED BY SMALL NUMBERS OF RELATORS (Q4923200) (← links)
- Search problems in groups and branching processes (Q5252307) (← links)
- 4-ENGEL GROUPS ARE LOCALLY NILPOTENT (Q5703668) (← links)
- An explicit algorithm for normal forms in small overlap monoids (Q6162859) (← links)
- PATCH graphs: an efficient data structure for completion of finitely presented groups (Q6560376) (← links)
