Algorithmic Problems in Amalgams of Finite Groups: Conjugacy and Intersection Properties

MaRDI QIDQ6206061zbMATH OpenFDO

Authors L. Markus-Epstein

Publication date 2 July 2007

Mathematics Subject Classification ID

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)

Abstract: Geometric methods proposed by Stallings for treating finitely generated subgroups of free groups were successfully used to solve a wide collection of decision problems for free groups and their subgroups. In the present paper we employ the generalized Stallings' methods, developed by the author, to solve various algorithmic problems concerning finitely generated subgroups of amalgams of finite groups.

This page was built for publication: Algorithmic Problems in Amalgams of Finite Groups: Conjugacy and Intersection Properties

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