The Gateway to Computer Science Excellence
+1 vote
77 views
The no. Of state in minimal dfa for string starting with abb and ending with b over the alphabet a,b .
Please  construct dfa
in Theory of Computation by (403 points) | 77 views
0
5?
0
how ????

can you show me a dfa????
0

 

check this one 

0

I think it should be 6.

@air1ankit 

you didn't show transition on input a from final state..you have to make one more non final state.

0
but string abbab is not accepted by given dfa and it is a valid member of given language
0

@Verma Ashish

if we take 1 more state, then minimum generated string of dfa is abbb

but according to question minimum generted string is abb

right?

+2

@srestha  No. 

See this dfa-

It accepts abb.  

0
Thank u
+1

@Verma Ashish

yes nice one :)

0

@Verma Ashish yes I did a mistake, and not it is correct ..thanks 

Please log in or register to answer this question.

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
50,666 questions
56,170 answers
193,841 comments
94,047 users