Logspace Computations in Graph Groups and Coxeter Groups
DOI10.1007/978-3-642-29344-3_21zbMath1283.20043OpenAlexW129605913MaRDI QIDQ2894469
Jonathan Kausch, Volker Diekert, Markus Lohrey
Publication date: 29 June 2012
Published in: LATIN 2012: Theoretical Informatics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-642-29344-3_21
word problemright-angled Artin groupsnormal form theoremsright-angled Coxeter groupsdeterministic Turing machinesnormal form computationsfree partially commutative inverse monoidslengths of geodesic normal forms
Analysis of algorithms and problem complexity (68Q25) Symbolic computation and algebraic computation (68W30) Geometric group theory (20F65) Free semigroups, generators and relations, word problems (20M05) Braid groups; Artin groups (20F36) Reflection and Coxeter groups (group-theoretic aspects) (20F55) Word problems, other decision problems, connections with logic and automata (group-theoretic aspects) (20F10)
Related Items