Thibault Godin, Ines Klimann. On bireversible Mealy automata and the Burnside problem. Theoretical Computer Science, 707:24-35, 2018. [doi]
@article{GodinK18,
title = {On bireversible Mealy automata and the Burnside problem},
author = {Thibault Godin and Ines Klimann},
year = {2018},
doi = {10.1016/j.tcs.2017.10.005},
url = {https://doi.org/10.1016/j.tcs.2017.10.005},
researchr = {https://researchr.org/publication/GodinK18},
cites = {0},
citedby = {0},
journal = {Theoretical Computer Science},
volume = {707},
pages = {24-35},
}