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

4.8kviews

written 8.7 years ago by

teamques10 ★ 70k

• modified 3.8 years ago

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

Marks: 10M

Year: May 2016

theory of computation

ADD COMMENT EDIT

1 Answer

361views

written 8.7 years ago by

teamques10 ★ 70k

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 …

Create a free account to keep reading this post.

and 5 others joined a min ago.

ADD COMMENT EDIT

Please log in to add an answer.