automatic groupsbroomlike combingcombable groupscontext-free languagesfinitely generated groupfree subgroup of finite index
Free nonabelian groups (20E05) Subgroup theorems; subgroup growth (20E07) Generators, relations, and presentations of groups (20F05) Word problems, other decision problems, connections with logic and automata (group-theoretic aspects) (20F10) Geometric group theory (20F65) Fundamental group, presentations, free differential calculus (57M05) Formal languages and automata (68Q45)
Recommendations
Cited in
(15)- A combinatorial proof of the removal lemma for groups
- A note on the class group of composita
- A note on the combinatorics of multiplication in groups
- Rewriting systems, plain groups, and geodetic graphs
- On groups presented by inverse-closed finite confluent length-reducing rewriting systems
- On Cayley graphs of virtually free groups.
- scientific article; zbMATH DE number 5901916 (Why is no real title available?)
- scientific article; zbMATH DE number 5722661 (Why is no real title available?)
- scientific article; zbMATH DE number 67430 (Why is no real title available?)
- COMBING NILPOTENT AND POLYCYCLIC GROUPS
- Automatic Groups Associated with Word Orders Other than Shortlex
- scientific article; zbMATH DE number 848021 (Why is no real title available?)
- Context-free groups and their structure trees.
- Ideals of equations for elements in a free group and context-free languages
- Vertex separators, chordality and virtually free groups
This page was built for publication: A REMARK ABOUT COMBINGS OF GROUPS
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4285347)