Question
Download Solution PDFConsider the finite automaton in the following figure.
Answer (Detailed Solution Below)
Detailed Solution
Download Solution PDFNFA
|
Input |
|
0 |
0 |
1 |
1 |
|
States |
q0(Initial) |
q0 |
q0 |
q0 |
q0 |
Therefore, qo is reachable.
|
Input |
|
0 |
0 |
1 |
1 |
|
States |
q0(Initial) |
q0 |
q0 |
q0 |
q1 |
Therefore, q1 is reachable.
|
Input |
|
0 |
0 |
1 |
1 |
|
States |
q0(Initial) |
q0 |
q0 |
q1 |
q2 |
Therefore, q2 is reachable.
The set of reachable states for the input string 0011is \(\left\{ {{q_0},\;{q_1},\;{q_2}} \right\}\)
Last updated on Jan 8, 2025
-> GATE CS 2025 Admit Card has been released on 7th January 2025.
-> The exam will be conducted on 1st February 2025 in 2 shifts.
-> Candidates applying for the GATE CE must satisfy the GATE Eligibility Criteria.
-> The candidates should have BTech (Computer Science). Candidates preparing for the exam can refer to the GATE CS Important Questions to improve their preparation.
-> Candidates must check their performance with the help of the GATE CS mock tests and GATE CS previous year papers for the GATE 2025 Exam.