@Praveen Saini

Can't we move like this q0,q0,q0,q1 because q0 has both 0,1 inputs

Can't we move like this q0,q0,q0,q1 because q0 has both 0,1 inputs

The Gateway to Computer Science Excellence

First time here? Checkout the FAQ!

x

+14 votes

Consider the finite automaton in the following figure:

What is the set of reachable states for the input string $0011$?

- {$q_0,q_1,q_2$}
- {$q_0,q_1$}
- {$q_0,q_1,q_2,q_3$}
- {$q_3$}

+27 votes

+1

@Praveen Saini Sir, can we also convert it to DFA and check, well, I did convert to DFA and found out that string 0011 end up in state {q0 q1 q2} I just want to confirm can we convert NFA to DFA and check it?

0

@praveen

1.How to tackle this type of problem.

2.why not Q3 is considered as it is the final state as any string accepted by automata must end up at final state.

Please suggest

Thanks

1.How to tackle this type of problem.

2.why not Q3 is considered as it is the final state as any string accepted by automata must end up at final state.

Please suggest

Thanks

- All categories
- General Aptitude 1.6k
- Engineering Mathematics 7.3k
- Digital Logic 2.7k
- Programming & DS 4.9k
- Algorithms 4.2k
- Theory of Computation 5.4k
- Compiler Design 2.1k
- Databases 4k
- CO & Architecture 3.5k
- Computer Networks 4.2k
- Non GATE 1.4k
- Others 1.5k
- Admissions 570
- Exam Queries 566
- Tier 1 Placement Questions 23
- Job Queries 70
- Projects 18

48,720 questions

52,823 answers

183,476 comments

68,570 users