A catalogue of complete group presentations
From MaRDI portal
Publication:1097968
DOI10.1016/S0747-7171(86)80004-9zbMath0636.20021OpenAlexW2008025600MaRDI QIDQ1097968
Publication date: 1986
Published in: Journal of Symbolic Computation (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/s0747-7171(86)80004-9
Coxeter groupsnormal formword problemfundamental groupsreductionscomplete presentationsymmetrized set of generatorswell-founded and confluent set of rules
Formal languages and automata (68Q45) Generators, relations, and presentations of groups (20F05) Word problems, other decision problems, connections with logic and automata (group-theoretic aspects) (20F10)
Related Items (6)
Infinite complete group presentations ⋮ Algorithms and topology of Cayley graphs for groups. ⋮ The use of Knuth-Bendix methods to solve the word problem in automatic groups ⋮ Finite complete rewriting systems for groups ⋮ Some relations on prefix reversal generators of the symmetric and hyperoctahedral group ⋮ Confluence of algebraic rewriting systems
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Finite complete rewriting systems and the complexity of word problem
- Artin groups and infinite Coxeter groups
- Surfaces and planar discontinuous groups. Revised and expanded transl. from the German by J. Stillwell
- Presentations of groups and monoids
- On Dehn's algorithm
- Dehn's algorithm for the word problem
- The complexity of Dehn's algorithm for word problems in groups
- Confluent Reductions: Abstract Properties and Applications to Term Rewriting Systems
- Confluent and Other Types of Thue Systems
- Implementation and Analysis of the Todd-Coxeter Algorithm
- The Complete Enumeration of Finite Groups of the Form Ri2=(RiRj)kij=1
- A practical method for enumerating cosets of a finite abstract group
This page was built for publication: A catalogue of complete group presentations
