Monoid presentations of groups by finite special string-rewriting systems

DOI10.1051/ITA:2004012zbMATH Open1071.20037OpenAlexW2069811919MaRDI QIDQ4825397FDOQ4825397

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

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

Recommendations

• Rewriting Systems and Embedding of Monoids in Groups
• On groups presented by monadic rewriting systems with generators of finite order.
• scientific article; zbMATH DE number 4036065
• scientific article; zbMATH DE number 1241626
• scientific article; zbMATH DE number 1206942
• scientific article; zbMATH DE number 1972807
• Monoid Presentations and Associated Groupoids
• scientific article; zbMATH DE number 1008515
• String rewriting and homology of monoids
• MONOIDS PRESENTED BY REWRITING SYSTEMS AND AUTOMATIC STRUCTURES FOR THEIR SUBMONOIDS

zbMATH Keywords

Cayley graphsdirect productsfree productsword problemmonoid presentationsplain groupsspecial string-rewriting systems

Mathematics Subject Classification ID

Free products of groups, free products with amalgamation, Higman-Neumann-Neumann extensions, and generalizations (20E06) 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)

Cites Work

• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Groups and Simple Languages
• Title not available (Why is that?)
• Group presentations, formal languages and characterizations of one- counter groups
• About the descriptive power of certain classes of finite string-rewriting systems

Cited In (8)

• Gilman's conjecture
• Completing a finite special string-rewriting system on the congruence class of the empty word
• On groups presented by monadic rewriting systems with generators of finite order.
• Space complexity and word problems of groups
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• On groups presented by inverse-closed finite confluent length-reducing rewriting systems

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4825397)