Monoid presentations of groups by finite special string-rewriting systems

DOI10.1051/ita:2004012zbMath1071.20037OpenAlexW2069811919MaRDI QIDQ4825397

Duncan W. Parkes, Richard M. Thomas, V. Yu. Shavrukov

Publication date: 28 October 2004

Published in: RAIRO - Theoretical Informatics and Applications (Search for Journal in Brave)

Full work available at URL: http://www.numdam.org/item?id=ITA_2004__38_3_245_0

zbMATH Keywords

free productsCayley graphsword problemdirect productsmonoid presentationsplain groupsspecial string-rewriting systems

Mathematics Subject Classification ID

Generators, relations, and presentations of groups (20F05) Grammars and rewriting systems (68Q42) Free products of groups, free products with amalgamation, Higman-Neumann-Neumann extensions, and generalizations (20E06) Word problems, other decision problems, connections with logic and automata (group-theoretic aspects) (20F10)

Related Items (2)

Gilman's conjecture ⋮ Space Complexity and Word Problems of Groups

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• About the descriptive power of certain classes of finite string-rewriting systems
• Group presentations, formal languages and characterizations of one- counter groups
• Groups and Simple Languages

This page was built for publication: Monoid presentations of groups by finite special string-rewriting systems