Consider the following deterministic finite automaton (DFA) defined over the alphabet, $\Sigma=\{a, b\}$. Identify which of the following language(s) is/are accepted by the given DFA.
Consider a finite state machine (FSM) with one input $X$ and one output $f$, represented by the given state transition table. The minimum number of states required to realize this FSM is ________ . (Answer in integer)
| Present state | Next state | Output $f$ | ||
|---|---|---|---|---|
| $X = 0$ | $X = 1$ | $X = 0$ | $X = 1$ | |
| A | F | B | 0 | 0 |
| B | D | C | 0 | 0 |
| C | F | E | 0 | 0 |
| D | G | A | 1 | 0 |
| E | D | C | 0 | 0 |
| F | F | B | 1 | 1 |
| G | G | H | 0 | 1 |
| H | G | A | 1 | 0 |
Ravi had __________ younger brother who taught at __________ university. He was widely regarded as _________ honorable man.
Select the option with the correct sequence of articles to fill in the blanks.
The CEO's decision to downsize the workforce was considered $$\underline {myopic} $$ because it sacrificed long-term stability to accommodate short-term gains.
Select the most appropriate option that can replace the word "myopic" without changing the meaning of the sentence.
GATE CSE Papers
All year-wise previous year question papers