Finitely generated subgroups of free groups as formal languages and their cogrowth

DOI10.46298/jgcc.2021.13.2.7617zbMATH Open1545.20028MaRDI QIDQ6566726

R. I. Grigorchuk, Arman A. Darbinyan, Asif Ali Shaikh

Publication date: 3 July 2024

Published in: Journal of Groups, Complexity, Cryptology (Search for Journal in Brave)

zbMATH Keywords

free groupdeterministic finite automataregular languagesSchreier graphscogrowthStallings foldingssubgroups growth

Mathematics Subject Classification ID

Subgroup theorems; subgroup growth (20E07) Algebraic theory of languages and automata (68Q70) Free nonabelian groups (20E05) Word problems, other decision problems, connections with logic and automata (group-theoretic aspects) (20F10)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Ergodic properties of boundary actions and the Nielsen-Schreier theory
• Topology of finite graphs
• Rational subgroups of biautomatic groups
• On the entropy of regular languages.
• Stallings foldings and subgroups of free groups
• On problems related to growth, entropy, and spectrum in group theory
• ON THE PROBLEM OF THE EXISTENCE OF AN INVARIANT MEAN ON A GROUP
• On rationality of the cogrowth series
• Permutation patterns are hard to count
• An Introduction to Symbolic Dynamics and Coding
• On the Intersection of Finitely Generated Free Groups

This page was built for publication: Finitely generated subgroups of free groups as formal languages and their cogrowth