1,132 views

3 Answers

Best answer
5 votes
5 votes


every state has 2 possibility nd for final states there r 2*2 choices nd for inital state there is no choice
total no of dfa=1*4*26=256

selected by
2 votes
2 votes
the answer must be 256...

bcz at  state can either be final or non final i.e.there will be 2*2=4 choice are there.

and at each state each input will have two possibility either it will remain at that state or move to another state and there are 3 input so there will be 2*2*2=8 possibility of movement from each state by taking 3 inputs

at X we will have 8 possibility and at Y we have 8 too..

hence total no.of dfa possible=4*8*8=256
2 votes
2 votes

Answer : 256

Explanation

no. of possible combinations for final states  --> 4

no. of possible combinations for transactions from x  --> 8 (23)

no. of possible combinations for transactions from y  --> 8 (23)

thus the total possible combinations are --> 4 * 8 * 8 = 256

Related questions

2 votes
2 votes
2 answers
1
4 votes
4 votes
3 answers
2
AnilGoudar asked Apr 1, 2017
3,832 views
How many 3 state DFA's can be constructed with a designated initial final state that accepts empty language over alphabet {a,b}?
3 votes
3 votes
2 answers
3
1 votes
1 votes
1 answer
4
Kaustubh _15 asked Jul 11, 2017
1,566 views
How many DFA's can be constructed with 3 states and 2 input symbols which accept empty language?