search
Log In
1 vote
192 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 192 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.

Related questions

1 vote
1 answer
1
97 views
Please someone explain this...how the language is phi and explain the problem..???? Thanks in advance
asked Aug 1, 2018 in Theory of Computation Ritam Biswas 1 97 views
0 votes
1 answer
2
253 views
Confusion in last printf Statement.. Can anyone explain what printf Statement want to say...
asked Dec 9, 2016 in Programming Kashyap Avinash 253 views
0 votes
1 answer
3
92 views
For question like :- Find minimum number of variable required to solve the expression in three address code. (not SSA) Do we need to consider the given variable also? Example:- q + r/3 + s – t * 5 + u * v/w how many variable required?
asked Sep 29, 2018 in Compiler Design sardendu 92 views
0 votes
1 answer
4
182 views
The number of distinct 1 letter subword present in “NAMITA” is equal to_______________ Answer given subwords are N,A,M,I,T But last ‘A’ is not a subword. Is it correct??
asked May 2, 2019 in Theory of Computation srestha 182 views
...