Spread the love

## Formal Languages & Automata Theory Important Questions Pdf file – FLAT Imp Qusts

Please find the attached pdf file of Formal Languages & Automata Theory Important Questions Bank – FLAT Imp Qusts

Link – FLAT Question Bank

**UNIT – I**

- Explain transition diagram, transition table with example.
- Define transition function of DFA.
- Define ε –transitions.

For more questions please download the above Pdf file

**UNIT – II**

- Define Regular Languages.
- Define Pumping Lemma.
- Write the applications of pumping lemma for regular languages.

For more questions please download the above Pdf file

**UNIT – III**

- Define Greibach normal form.
- Define nullable Variable.
- State the symbol is used to label the interior node of the parse tree.

For more questions please download the above Pdf file

**UNIT – IV**

- Write the Turing Machine model.
- Explain the moves in Turing Machine Understand
- Define an ID of a Turing Machine?

For more questions please download the above Pdf file

**UNIT – V**

- Define Chomsky hierarchy of languages.
- Define Universal Turing Machine
- Define LR(0) grammars.

For more questions please download the above Pdf file