@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

+12 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$}

+24 votes

0

@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?

- All categories
- General Aptitude 1.4k
- Engineering Mathematics 6k
- Digital Logic 2.3k
- Programming & DS 4.3k
- Algorithms 3.7k
- Theory of Computation 4.6k
- Compiler Design 1.7k
- Databases 3.4k
- CO & Architecture 2.9k
- Computer Networks 3.4k
- Non GATE 1.2k
- Others 1.3k
- Admissions 506
- Exam Queries 482
- Tier 1 Placement Questions 22
- Job Queries 64
- Projects 16

40,976 questions

47,609 answers

146,779 comments

62,342 users