FLAT:CIE 2 11 Nov 2024 Roll No: _______ Name:________________

12345678910
Across
  1. 4. The grammatical rules of regular grammar are often called
  2. 5. Number of Tuples in Turing Machine are _____
  3. 7. Language of finite automata is _______
  4. 8. _____ are the symbols that can’t be replaced by anything in a Production Rule
  5. 10. The grammar producing more than 2 parse trees is ______
Down
  1. 1. Ambiguous grammar is _____
  2. 2. In Moore machine output depends on _______
  3. 3. The non-terminal symbols are denoted by__letters
  4. 6. Pushdown Automata can ______ the stack
  5. 9. The production of form non-terminal -> ε is called:_________Production