Examples of defining groups by finite automata
Abstract
We construct the groups <A,B,C \;| \, A2,B2,C2,(ABC)2> and <A,B \;| \, A2,B4,(AB)4>, using 3-state automata over the alphabets \1,2,3\ and \1,2,3,4\. In addition, we show, how to define direct powers of G by automaton (when for G it's given), keeping the alphabet.
0
Turn this paper into a lesson
ArcXiv compiles a structured reading guide from this paper's metadata: plain-English importance, contributions, prerequisite concepts, which sections to read first, flashcards, and a quiz. Grounded in the abstract, never invented.