Groups generated by 3-state automata over a 2-letter alphabet, I

Ievgen Bondarenko; Rostislav Grigrchuk; Rostyslav Kravchenko; Yevgen Muntyan; Volodymyr Nekraschevych; Dmytro Savchuk; Zoran Sunié

doi:10.11606/issn.2316-9028.v1i1p1-39

Groups generated by 3-state automata over a 2-letter alphabet, I

Autores

Ievgen Bondarenko Texas A&M University
Rostislav Grigrchuk Texas A&M University
Rostyslav Kravchenko Texas A&M University
Yevgen Muntyan Texas A&M University
Volodymyr Nekraschevych Texas A&M University
Dmytro Savchuk Texas A&M University
Zoran Sunié Texas A&M University

DOI:

https://doi.org/10.11606/issn.2316-9028.v1i1p1-39

Resumo

Groups generated by 3-state automata over a 2-letter alphabet, I

Downloads

Não há dados estatísticos.

Downloads

PDF (English)

Publicado

2007-06-30

Como Citar

Bondarenko, I., Grigrchuk, R., Kravchenko, R., Muntyan, Y., Nekraschevych, V., Savchuk, D., & Sunié, Z. (2007). Groups generated by 3-state automata over a 2-letter alphabet, I. São Paulo Journal of Mathematical Sciences, 1(1), 1-39. https://doi.org/10.11606/issn.2316-9028.v1i1p1-39