Scribd
Upload
73 views

Examples

This document provides practice examples for constructing deterministic finite automata (DFAs) and regular expressions for various languages over the alphabet {0,1}. It includes 16 practice problems for Set 1 and constructing minimum state automata for 4 examples from textbooks. The time duration given for Set 1 is 4 days and 1 day is given for Set 2.

Uploaded by

Himanshu_Saree_2324
Copyright
© Attribution Non-Commercial (BY-NC)
Available Formats
Download as PDF, TXT or read online on Scribd
73 views

Examples

This document provides practice examples for constructing deterministic finite automata (DFAs) and regular expressions for various languages over the alphabet {0,1}. It includes 16 practice problems for Set 1 and constructing minimum state automata for 4 examples from textbooks. The time duration given for Set 1 is 4 days and 1 day is given for Set 2.

Uploaded by

Himanshu_Saree_2324
Copyright
© Attribution Non-Commercial (BY-NC)
Available Formats
Download as PDF, TXT or read online on Scribd
You are on page 1/ 2

PRACTICE EXAMPLES SET 1

Draw the DFA for the following languages. Also write their equivalent regular expressions
Q No 1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 LANGUAGE

Set of all strings over 0,1 ending in 00 Set of all strings over 0,1 containing odd no of 0s. Set of all strings over 0,1 containing odd no of 0s and 1s. Set of all strings over 0,1 containing even no of 0s and 1s. Set of all strings over 0,1 with no more than three 0s. Set of all strings over 0,1 with exactly three 0,s. Set of all strings over 0,1 where no of 0s is divisible by 3. Set of all strings over 0,1 containing 011 as substring. Set of all strings over 0,1 where tenth symbol from right is 1. Set of all strings over 0,1 that either begin or end with 01. L= {anbam n,m>1} L= {anbb n>=0} L= {abn a n>1} L= {abn am n>=2 m>=3} L= {w: |w| mod 5 != 0 } over {0,1} Set of all strings over 0,1 beginning with a 1 and when interpreted as a binary integer is a multiple of 5. Eg 101 , 10101 ,1111 are accepted L={w: every run of 0,s has length either two or three} Set of all strings where every 00 is immediately followed by 1. Set of strings over 0 ,1 where leftmost symbol differs from rightmost symbol Set of strings over 0 ,1 where leftmost two symbols and rightmost two symbols are identical Set of strings over 0 ,1 where leftmost two symbol differs from rightmost symbol
MK HUSSAIN @ IITM

17 18 19 20 21

Time Duration: 4 days.

PRACTICE EXAMPLES SET 2

Construct minimum state automation for the following DFA,s 1. Example 3.20 (KLP Mishra, P No 101) 2. Example 3.21 (KLP Mishra, P No 101) 3. Example 3.15 (KLP Mishra, P No 106, From Unsolved Exercise) 4. Example 3.16 (KLP Mishra, P No 106, From Unsolved Exercise)

Time Duration: 1 day MK HUSSAIN @ IITM

You might also like