Automatic groups
and Artin Examples
Finite state automaton that recognizes when a string of 1,+ is zero in mod 2 arithmetic
Finite state automata that recognizes when a word is reduced in the free group F2.
Finite state automaton Ma that recognizes when two reduced words differ by ‘a’ in the free group F2
Finite State Automaton that recognizes when a word in in Garside normal form in the braid group B3.
Thank you for listening!