Finite groups as groups of automata with no cycles with exit

Andriy Russyev

Abstract


Representations of finite groups as automata groups over a binary alphabet are investigated. The subclass of groups of automata with no cycles with exit is studied.


Keywords


automaton, automaton group, finite group, wreath product

Full Text:

PDF

Refbacks

  • There are currently no refbacks.