FLAT

Edit Answers
12345678910
Across
  1. 2. – Beginning state of an automaton
  2. 4. – Data given to automaton
  3. 7. – Rule describing state changes in automata.
  4. 9. – Set of allowed symbols
  5. 10. – DFA and NFA accept same languages.
Down
  1. 1. – Result produced by automaton
  2. 3. – Set of accepted strings
  3. 5. – Sequence of symbols
  4. 6. – Accepting state of an automaton
  5. 8. – Single element of alphabet