CSE 417 Automata and Theory of Computation

Automata and Theory of

Computation

CSE 417

DFA
2020

Dr. Nafees Mansoor

CSE 417 Automata and Theory of Computation

• Alphabet Inc. is a holding company that gives ambitious
projects the resources, freedom, and focus to make their
ideas happen.
• On January 16, 2020, Alphabet became the fourth US
company to reach a $1 trillion market value[39] entering
the trillion dollar companies club for the first time.

2020

Dr. Nafees Mansoor

2
 Alphabet

CSE 417 Automata and Theory of Computation

Ø A finite set of symbols.
Ø An alphabet is often denoted by sigma(Σ), yet can be given any name.
Ø B = {0, 1}
o Says B is an alphabet of two symbols, 0 and 1.
Ø Σ = {a, b, c, … z}
o Says Σ is an alphabet of 26 symbols, a to z.

String
u A sequence of symbol(s) from the alphabet set.
If Σ = {a, b}, then
Σ* = {a, b, aa, ab, aab …. }

2020

Dr. Nafees Mansoor

Language
CSE 417 Automata and Theory of Computation
u is a structured collection of strings
u can be a set with
u Finite elements or
u Infinite elements
u Ex. If Σ = {a…z}, then we can generate
u masaya ang araw ng araw ng linggo
u hari minggu adalah hari yang menyeronokkan
u Sunday is funday

2020

Dr. Nafees Mansoor

4
 READ THE SENTENCE AND COUNT THE F’S IN IT.

CSE 417 Automata and Theory of Computation

HOW MANY F’S WERE THERE?
⁉3
⁉4
⁉5
⁉6
2020

Dr. Nafees Mansoor

• Finite automata is a finite state machine

CSE 417 Automata and Theory of Computation
• The machine is designed to specify a language
• Finite automata works in states
• Takes an input string and determines whether the
string belongs to that language or not

String

Belongs to the
Finite Automata Language or not

2020

Dr. Nafees Mansoor

8
 CSE 417 Automata and Theory of Computation
DFA – Deterministic Finite Automata
NFA – Non-Deterministic Finite Automata

2020

Dr. Nafees Mansoor

u Finite automata determines whether a sting belongs to the given CSE 417 Automata and Theory of Computation
language or not
u Ex: language L1 is the set of all stings starting with a of Σ = {a, b}
= {a, aa, ab, abba, abb, … }

a/b

a String1 = bbaa
Q1 Q2
States = Q3->Q3->Q3->Q3
b
String1 = abba
Q3 States = Q2->Q2->Q2->Q2
a/b
2020

Dr. Nafees Mansoor

10
 If Σ = {0, 1}, and

CSE 417 Automata and Theory of Computation

Language L1 = set of all stings where zeros count will be even.

Even Odd 1
0 0
1
0

2020

Dr. Nafees Mansoor

11

u The formal definition of any Finite Automaton, M: CSE 417 Automata and Theory of Computation
u M ={Q, S, d, q0, F}
u Q={Set of Finite States}
u S={Set of Alphabets}
u d = transition rules
u current_state, symbol -> next_state
u q0 =Initial State
u F={Set of accepting states}

2020

Dr. Nafees Mansoor

12
 For example: Recognizing Strings Ending in “ing”

CSE 417 Automata and Theory of Computation

u Finite Automaton, M:
u M ={Q, S, d, q0, F}
u Q={Nothing, saw i, saw in, saw ing}
u S={A… Z, a…z}
u d-
u q0 =Nothing
u F={saw ing}

2020

Dr. Nafees Mansoor

13

CSE 417 Automata and Theory of Computation

Not i or g

Not i
Not i or n i

nothing Saw i Saw in Saw ing

i n g
i i
Start
Not i

2020

Dr. Nafees Mansoor

14