Part A (Two Marks)
Answer all questions
1 Define Finite Automata.
2 What are the applications of automata theory?
3 Differentiate NFA and DFA.
4 Construct NFA for the language which accepts the string ‘1100’ over an alphabet ∑={0,1}.
5 What is a : (a) String (b) Language? Give an example each.
6 Define regular grammar.
7 Differentiate L* and L+.
8 Build a regular expression to denote a language L which accepts all the strings which begin
with 00.
9 Show that (r*)*=r* for a regular expression r.
10 What is transition diagram?
11 What are the components of finite automaton?
12 Construct the FA for accepting all the strings with even length of 1’s.
13 Define Kleene Positive.
14 Differentiate NFA with ԑ and NFA without ԑ.
15 List the decision properties of regular language.
16 Build regular expression for the language that have the set of strings over {a,b,c} containing at
least one a and at least one b.
17 Write short notes on precedence of RE operators.
18 Convert the RE: (0+1)* into the FA.
Part B (14 Marks)
Answer all questions
19 (i) Summarize the central concepts of finite automata.
(ii) Construct the DFA which accepts the language over ∑={a,b} that has the set of all strings
starting with ‘aab’.
20 (i) Explain the operations on languages in finite automata
(ii) Convert the given NFA to the DFA.
(i) Convert the following NFA with ԑ to NFA without ԑ.
21
(ii) Explain the steps to construct the DFA which accept all the strings ending with a
substring of length L.
22 (i) Construct an FA for RE: 10 + (0 + 11)0*1
(ii) Discuss briefly the algebraic law’s for regular expressions.
Define a regular set using pumping lemma Show that the language L={0^i^2 / i is an
23
integer,i>=1} is not regular.
24 Explain pumbing lemma and its application with an example.
Convert the following NFA to it’s equivalent DFA.
25
Construct the DFA accepting the language over the alphabet 0,1 that have the string ends
26
up with substring 1011.
27 Elaborate on finite automata with epsilon-transitions.
28 Explain various algebraic properties of the regular language with a suitable example each.
29 (i) Briefly explain regular languages and its properties.
(ii) Convert the following RE 01*0 to ε-NFA.
30 (i) Describe the decision properties o regular languages in detail.
(ii) Prove the following RE: (1+00*1)+(1+00*1)(0+10*1)*(0+10*1) = 0*1(0+10*1)*
