scientific article; zbMATH DE number 848090

MaRDI QIDQ4867142zbMATH OpenFDO

Authors Géraud Sénizergues

Publication date 19 March 1996

zbMATH Keywords

finite sets of generatorsCayley-graphsaccessibility-lengthupper bounds on cardinalities of finite subgroups

Mathematics Subject Classification ID

Formal languages and automata (68Q45) Analysis of algorithms and problem complexity (68Q25) Graph theory (including graph drawing) in computer science (68R10) Free products of groups, free products with amalgamation, Higman-Neumann-Neumann extensions, and generalizations (20E06) Groups acting on trees (20E08) Generators, relations, and presentations of groups (20F05) Geometric group theory (20F65) Subgroup theorems; subgroup growth (20E07) Word problems, other decision problems, connections with logic and automata (group-theoretic aspects) (20F10)

Recommendations

• Logical aspects of Cayley-graphs: the group case
• Context-free pairs of groups. I: Context-free pairs and graphs
• Context-free groups and their structure trees.
• On accessibility of groups
• scientific article; zbMATH DE number 1202252

Cited in

(7)

• Groups, graphs, languages, automata, games and second-order monadic logic
• An effective version of Stallings' theorem in the case of context-free groups
• Finiteness Conditions on Subgroups and Formal Language Theory
• Context-free pairs of groups. I: Context-free pairs and graphs
• Context-Free Groups and Bass–Serre Theory
• Solutions to twisted word equations and equations in virtually free groups
• The isomorphism problem for finite extensions of free groups is in PSPACE

This page was built for publication:

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