Rewriting systems, plain groups, and geodetic graphs

DOI10.1016/j.tcs.2021.12.022OpenAlexW4206489805MaRDI QIDQ2072071

Adam Piggott, Murray J. Elder

Publication date: 1 February 2022

Published in: Theoretical Computer Science (Search for Journal in Brave)

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

zbMATH Keywords

geodetic graphlength-reducing rewriting systemplain group

Mathematics Subject Classification ID

Theory of computing (68Qxx)

Related Items (3)

Vertex separators, chordality and virtually free groups ⋮ On the connectivity and diameter of geodetic graphs ⋮ On groups presented by inverse-closed finite confluent length-reducing rewriting systems

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Geodetic blocks of diameter three
• About the descriptive power of certain classes of finite string-rewriting systems
• Geodetic graphs of diameter two and some related structures
• Gilman's conjecture
• Groups and Simple Languages
• Groups Presented by Finite Two-Monadic Church-Rosser Thue Systems
• Commutativity in groups presented by finite Church-Rosser Thue systems
• Finite and infinite cyclic extensions of free groups
• A REMARK ABOUT COMBINGS OF GROUPS
• On planar geodetic graphs
• Geodetic graphs of diameter two

This page was built for publication: Rewriting systems, plain groups, and geodetic graphs