Automata Theory Crossword

12345678910
Across
  1. 1. ______ machine contains infinite memory.
  2. 4. G = (V, T, P, S) is said to be _______ if there exists more than one derivation tree for the given input string.
  3. 5. There is only one _____ state in FA.
  4. 7. ______ machine is a finite state machine in which the output symbol depends upon the present input symbol and present state of the machine.
  5. 10. ______ stack is one of the acceptance by PDA.
Down
  1. 2. Automata are basically language ____________
  2. 3. _____ works on stack memory concept.
  3. 6. NFA can contain a ______ move.
  4. 8. _____ is a finite collection of symbols.
  5. 9. According to ______ hierarchy, grammars are divided of 4 types.