Scribd
Upload
3 views24 pages

Lecture 06

Uploaded by

hajrabatool64gb
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
3 views24 pages

Lecture 06

Uploaded by

hajrabatool64gb
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/ 24

THEORY OF

AUTOMATA
Lecture 06

SUPERIOR COLLEGE BHERA


2

Deterministic Finite Automata?


Construct a DFA which accepts set of all strings over Σ={a,b} contains a
R.E= (a+b)*a (a+b)* Language L = {a, ab, aaabbb, abba,baba ….}
3

Deterministic Finite Automata?


Construct a DFA which accepts set of all strings of odd length over Σ={a,b}
R.E= (a+b) ((a+b) (a+b))*
4

Deterministic Finite Automata?


Design a DFA over w ∈ {a,b}* such that number of a = 2 and there is no restriction over
length of b. R.E= b*a b* a b*
5

Deterministic Finite Automata?


Design a DFA in which number of a’s in the string are ≥ 2
R.E= (a+b)*a (a+b)* a (a+b)*
6

Deterministic Finite Automata?


Design a DFA in which number of a’s in the string are ≤ 2
R.E= b*(a+^) b* (a+^) b*
7

Deterministic Finite Automata?


Design a DFA in which number of a’s are divisible by 2. And input alphabet is {a,b}
R.E= b* [ b*a b*a b* ] *b*
8

Deterministic Finite Automata?


{TOA Paper 2020,2015} Design a DFA over {a,b} which contains at least one of the
two sub strings {ab, bba}
R.E= (a+b)* ab (a+b)* + (a+b)* bba (a+b)* = (a+b)*(ab+bba) (a+b)*
9

Deterministic Finite Automata?


{TOA Paper 2020,2015} Design a DFA for R. E {11+110}* 0
10

Deterministic Finite Automata?


{TOA Paper 2020,2015} Design a DFA for R. E {0,1}* 10
11

Deterministic Finite Automata?


{TOA Paper 2020,2015} Design a DFA for R. E {a,b}* baaa
12

Deterministic Finite Automata?


Design a DFA for R. E {00}* + {11}*
13

Deterministic Finite Automata?


{TOA Paper 2015} Design a DFA for R. E {00}* {11}*
14

Deterministic Finite Automata?


{TOA Paper 2019}

R.E= a+ a (a+b)* a
15

Deterministic Finite Automata?


{TOA Paper 2017}
What is the corresponding FA for the following R.E aa((a+b) (a+b))*
16

Deterministic Finite Automata?


Construct a DFA which accepts set of all strings of 0(MOD 3) length over Σ={a,b}
R.E= ((a+b) (a+b) (a+b))*
17

Deterministic Finite Automata?


Construct a DFA which accepts set of all strings of 1(MOD 3) length over Σ={a,b}
R.E= (a+b) ((a+b) (a+b) (a+b))*
18

Deterministic Finite Automata?


Construct a DFA which accepts set of all strings of 2(MOD 3) length over Σ={a,b}
R.E= (a+b) (a+b) ((a+b) (a+b) (a+b))*
19

Deterministic Finite Automata?


Construct a DFA which accepts set of all strings even a’s and even b’s over
Σ={a,b}
R.E=[aa+bb+(ab+ba)(aa+bb)*(ab+ba)]*
20

Deterministic Finite Automata?


Construct a DFA which accepts set of all strings odd 0’s and Odd 1’s over Σ={0,1}
21

Deterministic Finite Automata?


Construct a DFA which accepts set of all strings even no. of 0’s and Odd 1’s
over Σ={0,1}
22

Deterministic Finite Automata?


Construct a DFA which accepts set of all strings even no. of 0’s or Odd 1’s
over Σ={0,1}
23

Deterministic Finite Automata?


Construct a DFA which accepts set of all binary strings divisible by 2 over Σ={0,1}
Paper TOA 2017
Explaination: 10 is a binary equivalent to 2 in decimal and 2 is divisible by 2.
Means 110 in binary is equivalent to 6 in decimal and 6 is divisible by 2.
24

Deterministic Finite Automata?


Construct a DFA which accepts set of all binary strings divisible by 3 over Σ={0,1}

You might also like