Sur le problème des mots des quotients de groupes et produits libres

DOI10.24033/bsmf.1921zbMath0449.20047OpenAlexW2584461031MaRDI QIDQ3895676

Jean Perraud

Publication date: 1980

Published in: Bulletin de la Société mathématique de France (Search for Journal in Brave)

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

zbMATH Keywords

word problemDehn's algorithmfinitely generated free products

Mathematics Subject Classification ID

Generators, relations, and presentations of groups (20F05) Graphs and abstract algebra (groups, rings, fields, etc.) (05C25) 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)

Infinite Eulerian tessellations ⋮ Model-theoretic and algorithmic questions in group theory

Cites Work

• Sur les conditions de petite simplification qui permettent d'utiliser l'algorithme de Dehn
• On Dehn's algorithm
• Dehn's algorithm for the word problem
• On Dehn's algorithms for the conjugacy and word problems, with applications
• On Greendlinger's lemma
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Sur le problème des mots des quotients de groupes et produits libres