Open AccessGroups generated by 3-state automata over a 2-letter alphabet, I
Author(s) -
Ievgen Bondarenko,
Rostislav Grigorchuk,
Rostyslav Kravchenko,
Yevgen Muntyan,
Volodymyr Nekrashevych,
Dmytro Savchuk,
Zoran Šunić
Publication year - 2007
Publication title -
são paulo journal of mathematical sciences
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 0.379
H-Index - 7
eISSN - 2316-9028
pISSN - 1982-6907
DOI - 10.11606/issn.2316-9028.v1i1p
Subject(s) - alphabet , mathematical proof , automaton , class (philosophy) , abelian group , finite state machine , state (computer science) , computer science , group (periodic table) , theoretical computer science , mathematics , discrete mathematics , combinatorics , algorithm , artificial intelligence , linguistics , physics , philosophy , geometry , quantum mechanics