Scribd
Upload
58 views5 pages

Unit 2

This document outlines topics related to regular languages and finite automata including: 1. Writing regular expressions and designing finite automata for specific languages. 2. Comparing different types of finite automata like DFAs, NDFAS, and Moore/Mealy machines. 3. Converting between different representations like regular expressions, NFAs, and DFAs. 4. Proving properties of regular languages using techniques like pumping lemmas and closure properties.

Uploaded by

Raol Chavda Bhavyarajsinh
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
58 views5 pages

Unit 2

This document outlines topics related to regular languages and finite automata including: 1. Writing regular expressions and designing finite automata for specific languages. 2. Comparing different types of finite automata like DFAs, NDFAS, and Moore/Mealy machines. 3. Converting between different representations like regular expressions, NFAs, and DFAs. 4. Proving properties of regular languages using techniques like pumping lemmas and closure properties.

Uploaded by

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

UNIT 2: REGULAR LANGUAGES AND FINITE AUTOMATA

1. Write RE for the languages of all Strings that do not end with 01.
2. Give recursive definitions of the extended transition functions, δ* for DFA and
NFA.
3. Compare FA, NFA and NFA-^
4. Draw a FA for following regular language.
(i) (11+110)* 0 (ii) (0+1)*(10+11)
5. Design a Moore machine to determine residue number 3 for binary number.
6. Write Kleene’s Theorem Part-I, any regular language can be accepted by a finite
automation
7. Convert following NFA- Λ to NFA

8. Define DFA and NFA and NFA- Λ


9. Give recursive definitions of the extended transition functions, δ ̂ (i.e., for strings)
for DFA and NFA
10. Minimize the DFA:

11. Consider the NFA-Λ depicted in following table:


a. Compute the Λ-closure of each state.
b. Convert the NFA-Λ to a DFA.
12. Explain ‘finite state machines with outputs’. Discriminate between Mealy and
Moore machines.
13. Convert the Moore machine shown in Fig. into an equivalent Mealy machine.

14. Use Pumping Lemma to show that L = {x Є {0,1}*| x is a palindrome} is not a regular
language.
15. Using constructive approach determine NFA- Λ for the regular expression (0 +
1)*1(0 + 1).
16. Give recursive definition of regular expressions. State the hierarchy of the
operators used in regular expressions.
17. Fig. shows two DFAs M1 and M2, to accept languages L1 and L2, respectively.
Determine DFAs to recognize L1 U L2.
18. Convert the NFA given in Table below to its corresponding DFA and draw the DFA.

19. There are 2 languages over ∑ = {a , b}

L1 = all strings with a double “a”

L2 = all strings with an even number of “a”

Find a regular expression and an FA that define L1∩ L2

20. Prove that if L1 and L2 are regular languages then L1∩ L2 is also a regular
language.
21. Design a FA for the regular expression (0 + 1)(01)*(011)*
22. Write a regular expression for language L over {0,1} such that every string in L
i) Begins with 00 and ends with 11.
ii) Contains alternate 0 and 1
23. Prove Kleene’s Theorem (Part I): Any Regular Language can be accepted by a
Finite Automaton (FA).
24. Define NFA – Λ. Explain how to convert NFA – Λ into NFA and FA with suitable
example.
25. Write Regular Expressions corresponding to each of the following subsets of
{0,1}*
(i) The language of all strings in {0,1}* that containing at least two 0’s.
(ii) The language of all strings containing both 101 and 010 as substrings.
(iii) The language of all st rings that do not end with 01.
26. Convert the Mealy machine shown in given figure into Moore machine.

27. Draw FA for accepting:


(i)The string in {0,1}* ending in 1 and not containing substring 00.
(ii)The strings with odd no of 1’s and odd no of 0’s.
28. Explain Pumping Lemma and its applications.
29. What are the closure properties of regular languages?
30. Explain Moore machine and mealy machine.
31. What are the applications of finite automata? Draw Finite Automata to accept
following.
(i) the language accepting strings ending with ’01’ over input alphabets
Σ= {0, 1}
(ii) the language accepting strings ending with ‘abba’ over input
alphabets Σ = {a, b}
32. Write difference between DFA and NDFA. Convert the following NDFA to DFA.
33. Find a regular expression corresponding to each of the following subsets of {0, 1}*
(i) The language of all strings that begin or end with 00 or 11.
(ii) The language of all strings beginning with 1 and ending with 0.
34. What are the applications of regular expressions and finite automata?
35. Draw Finite Automata for 1. (01 + 10)* + 0. (11 + 10)*.

**********

You might also like