Geodesic rewriting systems and pregroups

zbMath1220.20022arXiv0906.2223MaRDI QIDQ5748110

Volker Diekert, Andrew J. Duncan, Alexei G. Myasnikov

Publication date: 14 September 2010

Full work available at URL: https://arxiv.org/abs/0906.2223

zbMATH Keywords

word problemrewriting systemsgeodesic wordsconfluent systemsgeodesically perfect systems

Mathematics Subject Classification ID

Generators, relations, and presentations of groups (20F05) Grammars and rewriting systems (68Q42) Word problems, other decision problems, connections with logic and automata (group-theoretic aspects) (20F10)

Related Items (4)

Amenability of Schreier graphs and strongly generic algorithms for the conjugacy problem ⋮ Topological finiteness properties of monoids. I: Foundations ⋮ Homological finiteness properties of monoids, their ideals and maximal subgroups. ⋮ Confluence of algebraic rewriting systems

This page was built for publication: Geodesic rewriting systems and pregroups