Abstract
AbstractLet G be a polycyclic, metabelian or soluble of type (FP)∞ group such that the class Rat(G) of all rational subsets of G is a Boolean algebra. Then, G is virtually abelian. Every soluble biautomatic group is virtually abelian.
Published Version
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have