Classification of groups generated by 3-state automata over a 2-letter alphabet
Ievgen Bondarenko, Rostislav Grigorchuk, Rostyslav Kravchenko, Yevgen, Muntyan, Volodymyr Nekrashevych, Dmytro Savchuk, Zoran Sunic
TL;DR
This paper reviews and consolidates existing results on classifying groups generated by 3-state automata over a 2-letter alphabet, building on prior research to provide a comprehensive overview.
Contribution
It compiles and extends known classifications of such groups, offering a unified reference for previous findings in the area.
Findings
Most known results on these groups are summarized.
Extended classification results from previous papers are included.
Provides a comprehensive overview of the classification landscape.
Abstract
This article contains most of the known results on the classification of groups generated by 3-state automata over a 2-letter alphabet, extending the previous papers 0704.3876 and math/0612178.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
Topicssemigroups and automata theory · Finite Group Theory Research · Geometric and Algebraic Topology