Beruflich Dokumente
Kultur Dokumente
1 a What is Model of Computation. List the basic models of computation. 2 M CO1 BTL1
b Construct NFA which accepts all strings ending with ‘aa’ over the ∑={a,b} 2 M CO3 BTL2
c Define Context Free Grammar 1 M CO4 BLT1
2 Explain about Finite State Automata Model and explain its elements. 5 M CO2 BTL2
3 Justify that there is an equivalent NFA for the following ↋-NFA 5 M CO3 BTL5
1 a What is Model of Computation. List the basic models of computation. 2 M CO1 BTL1
b Give ↋-NFA which accepts string ‘abac’ and all its suffixes over ∑={a,b,c} 2 M CO3 BTL2
c Define Context Free Grammar 1 M CO4 BLT1
2 Explain about Finite State Automata Model and explain its elements. 5 M CO2 BTL2
3 Convert the following NFA with to DFA 5 M CO3 BTL5
1 a What is Finite State Machine and give the mathematical representation. 2 M CO1 BTL1
b Give DFA which accepts only the string ‘abab’ over the ∑={a,b}. 2 M CO3 BTL2
c Define Context Free Grammar 1 M CO4 BLT1
2 Explain about Finite State Automata Model and explain its elements. 5 M CO2 BTL2
3 Convert the following NFA with to DFA 5 M CO3 BTL5