ON GROUPS PRESENTED BY MONADIC REWRITING SYSTEMS WITH GENERATORS OF FINITE ORDER

DOI10.1017/S0004972715000015zbMath1335.20037OpenAlexW2166807612MaRDI QIDQ5253345

Adam Piggott

Publication date: 5 June 2015

Published in: Bulletin of the Australian Mathematical Society (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1017/s0004972715000015

zbMATH Keywords

free productsplain groupsmonadic rewriting systems

Mathematics Subject Classification ID

Generators, relations, and presentations of groups (20F05) Automata and formal grammars in connection with logical questions (03D05) 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 ⋮ Groups whose word problems are not semilinear

Cites Work

• Unnamed Item
• Groups, the theory of ends, and context-free languages
• About the descriptive power of certain classes of finite string-rewriting systems

This page was built for publication: ON GROUPS PRESENTED BY MONADIC REWRITING SYSTEMS WITH GENERATORS OF FINITE ORDER