Ask
Login
0
4.5kviews
Design the DFA to accept all the binary strings over {0,1} that are beginning with 1 and having its decimal value multiple of 5
written 7.7 years ago by gravatar for teamques10 teamques10 ★ 68k •   modified 2.9 years ago

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

Marks: 10M

Year: May 2016
theory of computation
ADD COMMENT EDIT
1 Answer
0
357views
written 7.7 years ago by gravatar for teamques10 teamques10 ★ 68k

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:

$M = (Q, Σ, Ґ, δ,q_0, z_(0 ), F )$

$Q = {q_0, q_1, q_f}$

$ Σ= {a, b}$

$Ґ = {X, R}$

$q_0 = q_0$

$z_0 = R$

$F= {q_f}$

Diagram: enter image description here
ADD COMMENT EDIT
Please log in to add an answer.