1
GATE CSE 2002
MCQ (Single Correct Answer)
+2
-0.6
The Finite state machine described by the following state diagram with $$A$$ as starting state, where an arc label is $$x/y$$ and $$x$$ stands for $$1-bit$$ input and $$y$$ stands for $$2$$-bit output GATE CSE 2002 Theory of Computation - Finite Automata and Regular Language Question 73 English
A
Outputs the sum of the present and the previous bits of the input.
B
Outputs $$01$$ whenever the input sequence contains $$11$$
C
Outputs $$00$$ whenever the input sequence contains $$10$$
D
None of the above
2
GATE CSE 2002
MCQ (Single Correct Answer)
+1
-0.3
The language accepted by a pushdown Automation in which the stack is limited to $$10$$ items is best described as
A
Context free
B
Regular
C
Deterministic Context Free
D
Recursive
EXAM MAP