The Gateway to Computer Science Excellence
First time here? Checkout the FAQ!
x
0 votes
41 views
construct DFA which do not contain 11 as sub string but end with 0
asked in Theory of Computation by (85 points) | 41 views

1 Answer

+2 votes
Best answer

DFA which do not contain 11 as substring but end with 0 :

DFA

answered by (141 points)
selected by
0

it is correct.try to draw using this

http://madebyevan.com/fsm/

0

hey, thanks  but can we draw like this as well,please suggest

+1

poojasharma123

Assuming your states to be $A,B,C,D$

  • your DFA is accepting $\epsilon$ which it should not
  • state $C$ has no transition function defined for input$1$$\delta(C,1)=?$
  • state $D$ has no transition function defined for input$0,1$$\delta(D,0)=?,\delta(D,1)=?$

Actually your FSM is NFA which is wrong .

0
oh yes, I have done a lot of mistakes, Thank you
0
@sourav Yes, thanks for the information

Related questions



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

39,437 questions
46,622 answers
139,346 comments
57,002 users