368 views

1 Answer

Best answer
3 votes
3 votes
We need to take  6 steps to reach the final state. 1st,2nd,3rd,4th,5th,6th.

Out of these 6 steps 3 are horizontal step and 3 are vertical step.

It is our choice when we will take the vertial steps. Assume we have taken 2nd,4th,and 6th step vertial.

Selecting these 3 steps out of 6 steps has = $\binom{6}{3} = 20$ different ways.

Once we have selected, when to go vertical, there is no choice of permutation between a,b and c.

Among vertical steps we must follow order $a\rightarrow b\rightarrow c$ only. No other way.

Additionally once we fixed the vertical steps , horizontal step positions are also got fixed and they are also in the order $x\rightarrow y\rightarrow z$

=> Total no of accepted strings = 20. (D NONE)
selected by

Related questions

1 votes
1 votes
1 answer
1
Vasu_gate2017 asked Sep 30, 2016
383 views
JNU
0 votes
0 votes
0 answers
2
MonikaV asked May 19, 2019
241 views
Which of the following is not true about Turing machine?(a) It can accept any palindrome(b) It can accept any context free language(c) It can accept {a^m b^n c^mn:m,n>=0(...
0 votes
0 votes
0 answers
3
8676rau asked Feb 24, 2019
1,921 views
If inorder traversing a tree results in E A C K F H D B G, the preorder traversal wouldreturn(a) FAEKCDBHG(b) FAEKCDHGB(c) EAFKHDCBG(d) FEAKDCHBG
0 votes
0 votes
1 answer
4
nepobose asked May 14, 2018
333 views
If R be an equivalence relation on the set, A={6,7,8,9,10} defined by, R={(6,6),(7,7),(8,8),(9,9),(10,10),(6,7),(7,6),(8,9),(9,8),(9,10),(10,9),(8,10),(10,8)}, its partit...