Automata Adventures

1234567891011
Across
  1. 1. Context-free grammar abbreviation
  2. 4. A machine that can compute anything that is computable
  3. 6. Problem The famous undecidable problem by Alan Turing
  4. 8. When there is only one possible state transition
  5. 10. A type of automaton where multiple transitions are allowed
  6. 11. The set of strings over an alphabet
Down
  1. 2. A mathematical structure defining input-output behavior
  2. 3. Automaton A type of automaton used to recognize context-free languages
  3. 5. The language class recognized by a finite automaton
  4. 7. A problem that can be solved by an algorithm
  5. 9. A problem with no algorithmic solution