Time Left - 15:00 mins

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

Attempt now to get your rank among 677 students!

Question 1

Choose the correct statement for the following regular expression over the symbols 0 & 1.

0 + 1 + 0(0+1)*0 + 1(0+1)*1

Question 2

Which of the following language is regular?

Question 3

The value of a R.E r over ∑, denoted by val(r), is defined as follows:

1) Val(ϕ) = 0

2) Val( € ) = 0

3) Val ( a ) = 0 ¥ a € ∑

4) Val ((rs)) = val ((r + s )) = max. (val(r), val(s))

5) Val (()) = val (r) + 1

Find the value of the following R.E-

(a (a + aa))

Question 4

Which of the following is true?

Question 5

The number of states in minimal DFA for the language L = a+b+ / (ab)* is -

Question 6

Consider the following grammar G:

S ABA

A aA|bA|ϵ

B bb|bbB

The regular language for the above grammar G is

  • 677 attempts
  • 1 upvote
  • 3 comments
Oct 2GATE & PSU CS

Posted by:

Harshita AgarwalHarshita AgarwalMember since Jul 2020
Share this quiz   |