GATE CSE 1992 | GATE CSE Year Wise Previous Years Questions

PREVIOUS NEXT

GATE CSE 1992

MCQ (Single Correct Answer)

-0.6

Which of the following regular expression identities are true?

$$r\left( {^ * } \right) = r{}^ * $$

$$\left( {r{}^ * s{}^ * } \right){}^ * = \left( {r + s} \right){}^ * $$

$$\,\left( {r + s} \right){}^ * = r{}^ * + s{}^ * $$

$$r{}^ * s{}^ * = r{}^ * + s{}^ * $$

GATE CSE 1992

MCQ (Single Correct Answer)

-0.6

If $$G$$ is a context-free grammar and $$w$$ is a string of length $$n$$ in $$L(G),$$ how long is a derivation of $$w$$ in $$G,$$ if $$G$$ is Chomsky normal form?

$$2n$$

$$2n+1$$

$$2n-1$$

$$n$$

GATE CSE 1992

MCQ (More than One Correct Answer)

-0.6

Context-free languages are

closed under union

closed under complementation

closed under intersection

closed under Kleene closure.

GATE CSE 1992

MCQ (More than One Correct Answer)

-0.6

In which of the cases stated below is the following statement true?
“For every non-deterministic machine $${M_1}$$ there exists an equivalent deterministic machine $${M_2}$$ recognizing the same language“.

$${M_1}$$ is nondeterministic finite automation

$${M_1}$$ is a nondeterministic $$PDA$$

$${M_1}$$ is a non-deterministic Turing machine

For no machine $${M_1}$$ use the above statement true

PREVIOUS NEXT

GATE CSE Papers

2023