The Gateway to Computer Science Excellence

First time here? Checkout the FAQ!

x

0 votes

your initial state =**n _{0}**

let assume it as **0**... while **reading 'a'** going to one state forward...that implies **adding 1** to previous state

while **reading 'b'** going to one state backward... that implies **decreasing 1** to previous state...

if you have **same no.of a's and b's** ===> finally you are at **initial position** only

but you are aim is go to **n _{5} only**.....therefore you should have

0 votes

Answer: B

Starting with state {0},encountering 'a' would add 1 to present state and encountering 'b' would subtract 1 from present state.Since the final state is {5} hence the accepted strings will be a^5,a^6 b,a^7 b^2,... considering an 'a' as +1 and 'b' as -1.Hence the number of a's is 5 more than b.

Starting with state {0},encountering 'a' would add 1 to present state and encountering 'b' would subtract 1 from present state.Since the final state is {5} hence the accepted strings will be a^5,a^6 b,a^7 b^2,... considering an 'a' as +1 and 'b' as -1.Hence the number of a's is 5 more than b.

- All categories
- General Aptitude 1.3k
- Engineering Mathematics 5.2k
- Digital Logic 2k
- Programming & DS 3.7k
- Algorithms 3.2k
- Theory of Computation 4k
- Compiler Design 1.6k
- Databases 3k
- CO & Architecture 2.6k
- Computer Networks 3k
- Non GATE 1k
- Others 1.3k
- Admissions 486
- Exam Queries 435
- Tier 1 Placement Questions 18
- Job Queries 56
- Projects 9

36,157 questions

43,608 answers

123,961 comments

42,860 users