First time here? Checkout the FAQ!
0 votes

asked in Theory of Computation by Active (1.5k points) 3 25 42 | 153 views

2 Answers

+3 votes

Set of binary strings which is divisible by n can be formed by DFA having n states.

So, 8 states. But we can minimize it to 4 states.

answered by Loyal (4.6k points) 1 20 40
edited by
0 votes

min. four state is required

answered by Active (1.4k points) 5 17
edited by
how 8....??
@rajeshwar yadav can u provide me detailed steps on how to got this minimized dfa..!!

as i'm getting 5 states...
construct the dfa for (0+1)*ooo

any string gengerated by this regular expression is divisible by 8

Quick search syntax
tags tag:apple
author user:martin
title title:apple
content content:apple
exclude -tag:apple
force match +apple
views views:100
score score:10
answers answers:2
is accepted isaccepted:true
is closed isclosed:true
Top Users Oct 2017
  1. Arjun

    23398 Points

  2. Bikram

    17078 Points

  3. Habibkhan

    8264 Points

  4. srestha

    6296 Points

  5. Debashish Deka

    5438 Points

  6. jothee

    4978 Points

  7. Sachin Mittal 1

    4772 Points

  8. joshi_nitish

    4348 Points

  9. sushmita

    3966 Points

  10. Rishi yadav

    3804 Points

Recent Badges

Famous Question im.raj
Verified Human gk
Notable Question Sanjay Sharma
Popular Question Pravin Paikrao
Notable Question Sanjay Sharma
Notable Question Vineeta
Popular Question rahul sharma 5
Famous Question rahuldb
Great Question jothee
Notable Question Vaishali Trivedi
27,324 questions
35,176 answers
33,280 users