Time Left - 15:00 mins

# GATE CS 2021 : Theory of computation (App update required to attempt this test)

Attempt now to get your rank among 883 students!

Question 1

Consider the R.E, r =

How much of the following are valid strings of this language?

How much of the following are valid strings of this language?

1) 0101010011

2) 111100 1111001

3) 0011001100111

Question 2

find the number of states in the minimal DFA corresponding to the state diagram depicted below

Question 3

Regular languages are

Question 4

Consider the case of context sensitive language, which of the following problem is decidable. Where L1 and L2 are context sensitive language.

Question 5

A language accepted by a pushdown automaton in which stack size is limited to 100 is best described by

Question 6

Consider the following operation for Context-free languages (CFLs)

A) Complementation

B) Intersection

C) Kleene closure

D) Union

The number of operations in which CFL is closed is ____.

- 883 attempts
- 1 upvote
- 11 comments

Sep 30GATE & PSU CS

Posted by: