Virtually Biautomatic Groups
DOI10.1080/00927870802620241zbMATH Open1185.20037OpenAlexW1978690983MaRDI QIDQ3395192FDOQ3395192
Authors: Kazem Mahdavi, Gabe Merton, Leonidas Nguyen, Travis Schedler, Nathan Smith
Publication date: 24 August 2009
Published in: Communications in Algebra (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1080/00927870802620241
Recommendations
finitely generated groupsfinite-state automatasubgroups of finite indexpolycyclic subgroupsvirtually biautomatic groups
Geometric group theory (20F65) Word problems, other decision problems, connections with logic and automata (group-theoretic aspects) (20F10)
Cites Work
Cited In (4)
- The automorphism group of a finitely generated virtually abelian group.
- Polycyclic, metabelian or soluble of type \((\mathrm{FP})_\infty\) groups with Boolean algebra of rational sets and biautomatic soluble groups are virtually abelian
- Automatically presented groups.
- Commensurators of abelian subgroups of biautomatic groups
This page was built for publication: Virtually Biautomatic Groups
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3395192)