Documenti di Didattica
Documenti di Professioni
Documenti di Cultura
UNIT –I
Introduction
2 marks Questions
12 Mark Questions
1.Prove that ,if L is accepted by an NFA with _-transitions, then L is accepted by an NFA
without €-transitions.
2.Prove that for every regular expression there exist an NFA with €-transitions.
3.Construct the NFA with €-transitions from the given regular expression. ab, ab+
4.What are the steps to convert NFA to DFA
5.Conversion of DFA into regular expression.
UNIT –II
Context free Languages
2 marks Questions
1. What is the language generated by the grammar G=(V,T,P,S) where P={S->aSb, S->ab}?
2. What is :(a) derivation (b)derivation/parse tree (c) subtree
3. If S->aSb | aAb , A->bAa , A->ba .Find out the CFL
4. What is a ambiguous grammar?
5. Find CFG with no useless symbols equivalent to :
S-> AB
S->CA
B->BC
B->AB
A->a
C->aB
C->b
6. What are the three ways to simplify a context free grammar?
7. What are the properties of the CFL generated by a CFG?
8. Find the grammar for the language L={a2n bc ,where n>1 }
9.Find the language generated by :S->0S1 | 0A | 0 |1B | 1
10. Differentiate sentences Vs sentential forms
11. What is a formal language?
12.What is Backus-Naur Form(BNF)?
13. Let G= ( {S,C} ,{a,b},P,S) where P consists of S->aCa , C->aCa |b. Find L(G).
14.What is a parser?
12 Mark Questions
UNIT II
Pushdown Automata
2 marks Questions
12 Mark Questions
UNIT III
Turing Machine
2 marks Questions
12 Mark Questions
UNIT IV
Undecidability
2 marks Questions
12 Mark Questions
UNIT V
Computational Complexity
2 Marks Questions
12 marks