1
GATE CSE 2007
MCQ (Single Correct Answer)
+2
-0.6
Consider the following finite state automation GATE CSE 2007 Theory of Computation - Finite Automata and Regular Language Question 45 English

The language accepted by this automation is given by the regular expression

A
$${b^ * }a{b^ * }a{b^ * }a{b^ * }$$
B
$${\left( {a + b} \right)^ * }$$
C
$${b^ * }a{\left( {a + b} \right)^ * }$$
D
$${b^ * }a{b^ * }a{b^ * }$$
2
GATE CSE 2007
MCQ (Single Correct Answer)
+2
-0.6
Consider the following finite state automation GATE CSE 2007 Theory of Computation - Finite Automata and Regular Language Question 44 English

The minimum state automation equivalent to the above $$FSA$$ has the following number of states

A
$$1$$
B
$$2$$
C
$$3$$
D
$$4$$
3
GATE CSE 2007
MCQ (Single Correct Answer)
+2
-0.6
The language $$L = \left\{ {{0^i}{{21}^i}\,|\,i \ge 0} \right\}$$ over the alphabet $$\left\{ {0,1,2} \right\}$$ is
A
Not recursive.
B
is recursive and is a deterministic $$CFL$$.
C
is a regular language.
D
is not a deterministic $$CFL$$ but a $$CFL$$.
4
GATE CSE 2007
MCQ (Single Correct Answer)
+2
-0.6
Consider the $$CFG$$ with $$\left\{ {S,A,B} \right\}$$ as the non-terminal alphabet, $$\left\{ {a,b} \right\}$$ as the terminal alphabet, $$S$$ as the start symbol and the following set of production rules: GATE CSE 2007 Theory of Computation - Push Down Automata and Context Free Language Question 27 English

For the correct string of (earlier question) how many derivation trees are there?

A
$$1$$
B
$$2$$
C
$$3$$
D
$$4$$
EXAM MAP
Medical
NEET
Graduate Aptitude Test in Engineering
GATE CSEGATE ECEGATE EEGATE MEGATE CEGATE PIGATE IN
CBSE
Class 12