Login / Signup

On the complexity of the word problem for automaton semigroups and automaton groups.

Daniele D'AngeliEmanuele RodaroJan Philipp Wächter
Published in: Adv. Appl. Math. (2017)
Keyphrases
  • word problems
  • finite state automata
  • finite state machines
  • deterministic finite automata
  • cooperative
  • finite automaton
  • computer aided
  • computer mediated
  • grade students