Login / Signup

Word problems recognisable by deterministic blind monoid automata.

Mark Kambites
Published in: Theor. Comput. Sci. (2006)
Keyphrases
  • word problems
  • finite state automaton
  • similar problems
  • turing machine
  • cellular automata
  • grade students
  • finite automata
  • deterministic finite automata
  • regular expressions
  • high level
  • online learning
  • tree automata