Scribd
Upload
21 views5 pages

Theoretical Computer Science: Lecture - 3 8 July 2020 Asst. Professor Nilima Shingate

This document provides instructions for drawing deterministic finite automata (DFAs) with certain properties: 1. DFAs that start with and end with specific strings. 2. DFAs that have or do not have certain substrings. 3. Examples are given of DFAs over the languages {a,b} that start with 'b' and end with 'a', over {0,1} that start with '10' and end with '1', over {p,q,r} that start with 'rp' and end with 'qq', and over {x,y,z} that start with 'xy' and end with 'zy'.

Uploaded by

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

Theoretical Computer Science: Lecture - 3 8 July 2020 Asst. Professor Nilima Shingate

This document provides instructions for drawing deterministic finite automata (DFAs) with certain properties: 1. DFAs that start with and end with specific strings. 2. DFAs that have or do not have certain substrings. 3. Examples are given of DFAs over the languages {a,b} that start with 'b' and end with 'a', over {0,1} that start with '10' and end with '1', over {p,q,r} that start with 'rp' and end with 'qq', and over {x,y,z} that start with 'xy' and end with 'zy'.

Uploaded by

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

Theoretical Computer Science

Lecture - 3
8 July 2020
Asst. Professor Nilima Shingate
DFA

1) Draw DFA ,Start with - Done


2) Draw DFA , End with - Done
3) Draw DFA , Start with and End with
4) Draw DFA having substring
5) Draw DFA not having substring
6) Draw DFA with all possibilities
(Combination of All)
7) Having common substring *
3. Draw DFA , St. and Ends With Sum
 Draw DFA over a language { a, b} which st.
with ‘b’ ends with ‘a’.

Step I) Accepted Strings


ba baaa , babbaaa , babaaa , aaaa , ab

b a
Anything
will do
Solve :
 Draw DFA over a language { 0 , 1 } which st.
with ’10’ and with ‘1’.

 Draw DFA over a language { p,q,r} which st.


with ‘rp’ end with ‘qq’.

 Draw DFA over a language { x,y,z} which st.


with ‘xy’ end with ‘zy’.
THANK
YOU !!!

You might also like