0
2.4kviews
a. Design a DFA over an alphabet {a, b} to recognize a language in which every a is followed by b

Mumbai University > Computer Engineering > Sem 4 > Theoretical Computer Science

Marks: 5M

Year: Dec 2016

1 Answer
0
105views

Definition: DFA Consist of finite set of states, one state is called start state and there can be one/more final states.

Logic:

enter image description here

Implementation Implementation:

M=(Q,Σ,Ґ,δ,q0,z(0),F)

Q=q0,q1,qf

Σ=a,b

Ґ=X,R

q0=q0

z0=R

F=qf

Diagram:

enter image description here

Please log in to add an answer.