Rewriting systems of Coxeter groups

DOI10.1016/0022-4049(94)90019-1zbMath0829.20048OpenAlexW2019795166MaRDI QIDQ1321036

Susan M. Hermiller

Publication date: 15 January 1996

Published in: Journal of Pure and Applied Algebra (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0022-4049(94)90019-1

zbMATH Keywords

Coxeter groupsgeneratorsword problemfundamental groupsregular languagesorientable closed surfacesfinite presentationsfinite complete rewriting systems

Mathematics Subject Classification ID

Generators, relations, and presentations of groups (20F05) Reflection and Coxeter groups (group-theoretic aspects) (20F55) Fundamental group, presentations, free differential calculus (57M05) Word problems, other decision problems, connections with logic and automata (group-theoretic aspects) (20F10)

Related Items

Infinite complete group presentations, Algorithms and topology of Cayley graphs for groups., Effective topological complexity of orientable-surface groups, Finite complete rewriting systems for groups, Automatic Groups Associated with Word Orders Other than Shortlex, Deciding embeddability of partial groupoids into semigroups, Artin groups, rewriting systems and three-manifolds

Uses Software

• RRL

Cites Work

• Orderings for term-rewriting systems
• A note on a special one-rule semi-Thue system
• Word problems and a homological finiteness condition for monoids
• Rewriting techniques and applications. 3rd international conference, RTA-89, Chapel Hill, NC, USA, April 3--5, 1989. Proceedings
• A finiteness property and an automatic structure for Coxeter groups
• On theories with a combinatorial definition of 'equivalence'
• On the Homology of Associative Algebras
• Confluent Reductions: Abstract Properties and Applications to Term Rewriting Systems
• Isoperimetric inequalities for soluble groups
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item