This document contains information about a finite automaton (DFA) including its definition, components, and an example. It defines a DFA as a 5-tuple consisting of a set of states Q, a start state q0, an alphabet set Σ, a transition function δ, and a set of accept states F. It then provides the specific components for one DFA with Q={1,2,3}, q0=1, Σ={L,D,+,-}, F={3}, and the transition table. It demonstrates this DFA accepting the string "IU5+K9-" and rejecting the strings "1k41-6+" and "S4*K" as there is no transition path to an

7. Name ID
MD. Furkanul Islam 12303051
MD. Shahariar Alam 12303043
MD. Tanjid Hossin 12303029
Khandaker Ashiqur Rahman 11203045
MD. Zillur Rahman 11203013
Rajib Saha 12303026

8. +,-
L
L,D
Others
without L
1
3
L= a-z
D= 0-9
Others= without L,D,+,-
Start
Transition diagram :

9. A finite automaton (DFA) is a 5-tuple ( Q , q0, ∑, δ, F):
Q- set of state.
q0- start state.
∑- set of alphabet.
δ-Qx∑→Q
F-set of accept state.

10. Here,
Q={1,2,3}
q0=1
∑={L,D,+,-}
F={3}
δ-Qx∑→Q
State L D +,- Others
1 2 3 3 3
2 2 2 1 3
Transition table
L= a-z
D= 0-9

11. +,-
L
L,D
Others
without L
1
3
Example : For accept string
IU5 + K 9 - P
Accept
Start

12. +,-
L
L,D
Others
without L
1
3
Example : For reject string
1 k41-6+
Rejected
There is no way to
Go another state.
Start

13. +,-
L
L,D
Others
without L
1
3
Example : For reject string
S 4 * K
Rejected
There is no way to
Go another state.
Start