Scribd
Upload
41 views9 pages

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

This document discusses drawing deterministic finite automata (DFAs) with certain properties: 1. DFAs that start with and end with specific symbols. 2. DFAs that have or do not have certain substrings. 3. DFAs that allow all possible combinations of the above properties. It provides examples of DFAs that end with specific symbols like 'a' or '1' over different languages. It notes that end conditions require an error state and final states with self-loops for accepting symbols. Transition tables and tuples are used to formally define the DFAs.

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
41 views9 pages

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

This document discusses drawing deterministic finite automata (DFAs) with certain properties: 1. DFAs that start with and end with specific symbols. 2. DFAs that have or do not have certain substrings. 3. DFAs that allow all possible combinations of the above properties. It provides examples of DFAs that end with specific symbols like 'a' or '1' over different languages. It notes that end conditions require an error state and final states with self-loops for accepting symbols. Transition tables and tuples are used to formally define the DFAs.

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/ 9

Theoretical Computer Science

Lecture - 3
8 July 2020
Asst. Professor Nilima Shingate
DFA
1) Draw DFA ,Start with - Done
2) Draw DFA , End with
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 *
1. Draw DFA , END’S With Sum
 Draw DFA over a language { a, b} which ends
with ‘a’.

Step I) Accepted Strings


a, baaa , babbaaa , babaaa , aaaa , ab

a
Anything
will do
 CL UE / HINT :

1) Only St. with sum has ERROR state.


2) Not other Sums or any Combinations has
ERROR state.
3) If End with sum has only one Condition
Symbol like
end with a , end with b
then at the End state that is on Final state loop
of itself.
4) From the Final state all remaining Symbol will
backtrack to the nearest loop of Same Symbol.
 Step 2 ) Transition Diagram

b a
a q1
q0 q1

b
 Step 3) Transition Table :

∂ a b

q0 q1 q0

q0
q1 q1
 Step 4) Definition :
M = {Q, ∑, ∂, q0 , F} Five Tuples
Q = {q0,q1}
∑ = {a,b}
∂ = Transition mapping Function
Q→Q X∑
q0 = {q0}
F = {q1}

Final state shows with double circle.


Solve :
 Draw DFA over a language { 0 , 1 } which end
with ‘1’.

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


with ‘qq’.

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


with ‘zy’.
THANK
YOU !!!

You might also like

pFad - Phonifier reborn

Pfad - The Proxy pFad of © 2024 Garber Painting. All rights reserved.

Note: This service is not intended for secure transactions such as banking, social media, email, or purchasing. Use at your own risk. We assume no liability whatsoever for broken pages.


Alternative Proxies:

Alternative Proxy

pFad Proxy

pFad v3 Proxy

pFad v4 Proxy