Deterministic Finite Automata

For Example:

We can make a design DFA with 2 state:


Five tuple (Q,Σ,δ,q0,F):
Q
: states
:{A,B}
Σ
: alphabet  
:{a,b}
q0
: start states
: A
F
: final/accept states
:{B}
δ 
: transition function
:

δ
a
b
A
B
B
B
B
B

No comments:

Post a Comment

Simple Design of Automata < Desain Automata Sederhana >

look a sample simple design of Automata: Five tuple (Q, Σ,δ , q0,F): Q : states :{q0,q1} Σ : alphabet (input) :{0,1 }...