Scribd
Upload
17 views18 pages

Automata1 Presentation

the is 4rth

Uploaded by

itsaligulzar
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
17 views18 pages

Automata1 Presentation

the is 4rth

Uploaded by

itsaligulzar
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/ 18

.

NAME: MUHAMMAD ALI

ROLL NO: 19096

SUBJECT: FINITE AUTOMATA

BSSE 5TH D
FINITE AUTOMATA
CONSIST OF 5 PARTS
(NUMBER OF STATES, INITIAL STATE, FINAL STATE ,
ALPHABET, TRANSITION)
Difference btw NFA and DFA

NFA
• Letters can move to one or more state.
• Dead state is not required
• Allows Null transition.
• NFA is easier to construct.
Regular Expression to finite Automata in NFA
(ab)*+(a+ab)*b*(a+b)*
[ a+ba(a+b) ]*a(ba)*b*
b(a+ba+abb)ba+(ba)*
Finite Automata in NFA to Regular Expression
a(ba)*C
a(b+ca)*d
(baE + Eab)*
DFA
• Letters can move to one or more state.
• Dead state is not required
• Allows Null/Epsilon transition.
DFA Example

TG(Transition Graph)

Finite number of states at least one initial state and final state or can be more
Dead state is not required
One letter can be move to more then one state
Can read more then one characters at a time
Null transition
R=(a+b)*(aaa+bbb)(a+b)*
R=p( p + q ) * q + q ( p + q ) * p
Null Transition

You might also like