Scribd
Upload
55 views2 pages

Important Questions 2k21 A Series1

The document contains a series of questions related to finite automata, regular expressions, and their properties. It covers topics such as designing DFAs and NFAs, proving languages are not regular, and constructing regular expressions. Additionally, it compares different types of automata and their transition functions.

Uploaded by

safiyamujeeb76
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as DOCX, PDF, TXT or read online on Scribd
55 views2 pages

Important Questions 2k21 A Series1

The document contains a series of questions related to finite automata, regular expressions, and their properties. It covers topics such as designing DFAs and NFAs, proving languages are not regular, and constructing regular expressions. Additionally, it compares different types of automata and their transition functions.

Uploaded by

safiyamujeeb76
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as DOCX, PDF, TXT or read online on Scribd
You are on page 1/ 2

Important questions

2. Design a DFA for the language L = {x ∈ {a,b}* | 'aba' is not a substring in x. }


1. How can you differentiate between DFA and NFA ?

3. Generate regular expression for strings in which number of a's is a multiple of three.
={ a,b}
4. Write the recursive definition of regular expression
5. Explain any three closure properties of regular languages
6. Draw the state-transition diagram showing an NFA N for the following Language L.

L = {x ∈ {a, b} * | x contains ‘bab’ as a substring}


Obtain the DFA D equivalent to N by applying the subset construction algorithm.

7. Obtain the DFA over the alphabet set Σ = {a, b}, equivalent to the regular grammar G
with start symbol S and productions: S -> aA | bS , A->aB | bS | a and B->aB | bS | a
8. Construct an £-NFA for the language L={ 0n1m2p | n,m,p >=0 } and convert it into
equvalent NFA without £-transitions
9. Draw the state-transition diagram showing an NFA N for the following language L.

L = {x ∈ { a,b}* | the second last symbol in x is b}


Obtain the DFA D equivalent to N by applying the subset construction algorithm.

10. Using pumping lemma for Regular Languages, prove that the language. L = {a nbn | n
>0} is not Regular.
11. Convert the regular expression to NFA with epsilon transition a (a+b)*aabb.
12. Write regular expression for the language

ii) L={w ∈ {0,1}* | w has no pair of consecutive 0’s.


i) The set L of strings in which every ‘a’ is immediately followed by at least two b’s

13. Construct regular expression from the given DFA

14. Construct regular Grammar for the given DFA


15. Design a DFA that accepts set of strings with even number of 0’s and odd number of
1’s over ∑= {0,1}*
16. Compare the transition functions of DFA, NFA, £--NFA
17. Construct regular expression for the language that consists of all strings ending with
00. Assume Σ= {0, 1}.
18. Design deterministic finite automata for the regular language that consist of all
strings with at least two consecutive 0’s. Assume Σ = {0, 1}.
19. Define Non Deterministic Finite Automata? Compare its ability with Deterministic
Finite Automata in accepting languages.
20. a) Design a Finite state automata which accepts all strings over {0,1} with odd
number of 1’s and even number of 0’s.
b) Show the changes needed to convert the above designed automata to accept
even number of 1’s and odd number of 0’s
21. Construct regular expression corresponding to the following state diagram:

22. Find the equivalent DFA for the regular expression (0+1)*011.
23. Construct NFA without – transitions from the following NFA 'M'.
M=({q0, q1, q2}, {a, b, c}, δ , q0, {q2}) and
δ(q0 , a) = {q0},
δ(q0 , b) = {q1},
δ(q0 , c) = {q2}
δ(q1 , £ ) = {q0},
δ(q1 , a) = {q1},
δ(q1 , b) = {q2},
δ(q2 , £ ) = {q1},
δ(q2 , a) = {q2},
δ(q2 , c) = {q0}

You might also like