Time Left - 05:00 mins

ISRO Exam CS 2017 Daily Quiz -10 (Theory of computation)

Attempt now to get your rank among 633 students!

Question 1

If L and L’ are recursively enumerable, then L is

Question 2

An FSM (Finite State Machine) can be considered to be a TM (Turing Machine) of finite tape length

Question 3

Let L={w ∈ (0 + 1)*|w has even number of 1s}, i.e. L is the set of all bit strings with even number of 1s. Which one of the regular expression below represents L?

Question 4

Which of the following sentences can be generated by
S -> aS l bA
A -> d l cA

Question 5

Consider the following Deterministic Finite Automaton $M$ .

Let $S$ denote the set of eight bit strings whose second, third, sixth and seventh bits are 1. The number of strings in $S$ that are accepted by $M$ is

633 attempts
3 upvotes
16 comments

Tags :

GATE & PSU CS Theory of Computation

Apr 2GATE & PSU CS