Register

GO Classes Test Series 2024 | Mock GATE | Test 13 | Question: 25

• retagged by
433 views
4 votes
4 votes

A garage door opens if it ever sees the password $011$ in a transmission. More formally, this FSM takes a bitstring consisting of $\text{0's}$ and $\text{1's}$ as its input, and continually outputs $\text{0's}$ until it sees the substring $011,$ after which it outputs $\text{1's}$ continuously. Example executions of this FSM are below:

For each of the numbered arrows, which of the following marks the correct FSM state transition?

  1. Arrow $1 - (0/0)$
  2. Arrow $3 - (1/0)$
  3. Arrow $4 - (1/0)$
  4. Arrow $5 - (1/1)$
• retagged by
User Avatar

1 Answer

Voting & Accepting an answer helps improve the community
Answer:
← PreviousNext →
← Previous in categoryNext in category →

Related questions

646
views
3 answers
2 votes
GO Classes asked Jan 28
646 views
GO Classes Test Series 2024 | Mock GATE | Test 13 | Question: 59
For the circuit in the figure below, if the current state $\text{Q}_3\text{Q}_2\text{Q}_1\text{Q}_0$ is $6$ ... the clock signal the new state will be (in decimal)? (the flip-flops are positive edge triggered)
User Avatar
472
views
2 answers
3 votes
GO Classes asked Jan 28
472 views
GO Classes Test Series 2024 | Mock GATE | Test 13 | Question: 27
What statement is correct for $f(A, B)$ in the following circuit?$f(A, B)=\overline{\overline{A \cdot B} \cdot(A+B)}$ when Control $=1$ ... }$ when Control $=1$f(A, B)=\overline{A} \cdot \overline{B}$ when Control $=0$
User Avatar
625
views
1 answers
6 votes
GO Classes asked Jan 28
625 views
GO Classes Test Series 2024 | Mock GATE | Test 13 | Question: 24
Let $\mathrm{M}$ be a $8$-state Deterministic Finite Automaton over the alphabet $\{a, b, c\}$. If the language accepted by $\text{M}$ i.e. $\text{L(M)}$ is finite, then the maximum possible cardinality of $\text{L(M)}$ is __________.
User Avatar
448
views
1 answers
4 votes
GO Classes asked Jan 28
448 views
GO Classes Test Series 2024 | Mock GATE | Test 13 | Question: 26
The figure below represents the Karnaugh map for a function $\text{F(A,B,C,D).}$ Note, $\text{ X'}$ stands for don't care.The simplified ... can be converted into a circuit implementation using only NAND gates, which is shown in:abcd
User Avatar
Link Copied!