Open AccessConnected reversible Mealy automata of prime size cannot generate infinite Burnside groups
Author(s) -
Thibault Godin,
Ines Klimann
Publication year - 2016
Publication title -
hal (le centre pour la communication scientifique directe)
Language(s) - English
Resource type - Conference proceedings
Subject(s) - automaton , prime (order theory) , mathematics , computer science , theoretical computer science , combinatorics