How did you get the sequence of states as in the diagram?

The Gateway to Computer Science Excellence

+4 votes

Best answer

- $Q_{3N} = D_3 \Rightarrow Q_{3N} = Q_2$
- $Q_{2N} = D_2 \Rightarrow Q_{2N} = Q_1$
- $Q_{1N} = D_1 \Rightarrow Q_{1N} = Q_3 \oplus Q_2$

$$ \begin{array}{|ccc|ccc|} \hline \textbf{$Q_1$} & \textbf {$Q_2$} &\textbf {$Q_3$} & \textbf {$Q_{1N}$} & \textbf{$Q_{2N}$} & \textbf{$Q_{3N}$}\\\hline0&0&0&0&0&0 \\\hline 0&0&1&1 &0 &0\\\hline 0&1&0&1&0&1\\\hline0&1&1&0&0&1 \\\hline1&0&0&0&1&0 \\\hline 1&0&1&1 &1 &0\\\hline 1&1&0&1&1&1\\\hline1&1&1&0&1&1 \\\hline \end{array}$$Given that the initial state $=S_4 = 100.$

Unreachable state is $S_0$

So, set of states which are not reachable $= \{S_{0}\}$

- All categories
- General Aptitude 1.9k
- Engineering Mathematics 7.5k
- Digital Logic 2.9k
- Programming and DS 4.9k
- Algorithms 4.3k
- Theory of Computation 6.2k
- Compiler Design 2.1k
- Databases 4.1k
- CO and Architecture 3.4k
- Computer Networks 4.1k
- Non GATE 1.5k
- Others 1.5k
- Admissions 595
- Exam Queries 576
- Tier 1 Placement Questions 23
- Job Queries 72
- Projects 17

50,648 questions

56,429 answers

195,206 comments

99,909 users