z-logo
open-access-imgOpen Access
Connected 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

The content you want is available to Zendy users.

Already have an account? Click here to sign in.
Having issues? You can contact us here
Accelerating Research

Address

John Eccles House
Robert Robinson Avenue,
Oxford Science Park, Oxford
OX4 4GP, United Kingdom