1
GATE CSE 2002
MCQ (Single Correct Answer)
+2
-0.6
Which of the following is true?
A
The complement of a recursively language is recursive.
B
The complement of a recursively enumerable language is recursively enumerable.
C
The complement of a recursively language is either recursive or recursively enumerable.
D
The complement of a context-free language is context-free.
2
GATE CSE 2002
MCQ (Single Correct Answer)
+2
-0.6
The $$C$$ language is:
A
A context free language
B
A context sensitive language
C
A regular language
D
Parsable fully only by a Turing machine
3
GATE CSE 2002
MCQ (Single Correct Answer)
+2
-0.6
The smallest finite automaton which accepts the language
$$L = \left. {\left\{ x \right.} \right|$$ length of $$x$$ is divisible by $$\left. 3 \right\}$$ has
A
$$2$$ states
B
$$3$$ states
C
$$4$$ states
D
$$5$$ states
4
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 65 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
EXAM MAP
Medical
NEETAIIMS
Graduate Aptitude Test in Engineering
GATE CSEGATE ECEGATE EEGATE MEGATE CEGATE PIGATE IN
Civil Services
UPSC Civil Service
Defence
NDA
Staff Selection Commission
SSC CGL Tier I
CBSE
Class 12