We construct a family of automata with n states. n >= 4, acting on a rooted binary tree that generate the free products of cyclic groups of order 2. Published by Elsevier Inc.
科研之友
微信
新浪微博
Facebook
分享链接
