Scribd
Upload
17 views4 pages

Toc Q2

Toc new style questions 2

Uploaded by

khanzd029
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
17 views4 pages

Toc Q2

Toc new style questions 2

Uploaded by

khanzd029
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
You are on page 1/ 4

THEORY OF COMPUTATION

AUTOMATA- 1
1.
r1 = 1 (0 + 1)*
r2 = 1 (1 + 0)+
r3 = 1 1* 0

Relation?

(a) L (r1) ⊆ L (r2) and L(r1) ⊆ L(r3) (b) L (r1) ⊇ L (r2) and L(r2) ⊇ L(r3)
(c) L (r1) ⊇ L (r2) and L(r2) ⊆ L(r3) (d) L (r1) ⊆ L (r3) and L(r2) ⊆ L(r1)

2. Give the strongest correct statement about finite language over finite Ʃ ?

(a) It could be undecidable


(b) It is Turing-recognizable
(c) It is CSL
(d) It is regular language

3. Let n1 be the number of states in minimal NFA of a partial language and n2 be the DFA.

Relation?

(a) n1 ≥ n2 (b) n1 ≤ n2
(c) n1 < n2 (d) n2 > n1

4.
S1: L is regular. Infinite union of L will also be regular i.e. (L0 ∪ L1 ∪ L2 . . .)
S2: L is regular. It’s subset will also be regular.

(a) Both are true (b) Both are false


(c) S1 → T, S2 → F (d) S1 → F, S2 → T

5. Consider r = (11 + 111)* over Ʃ = {0, 1}. Number of states in minimal NFA and DFA
respectively:

(a) N – 3, D – 4 (b) N – 3, D – 3

1
(c) N – 3, D – 3 (d) N – 4, D – 4

6. A Language is said to be regular iff

(a) There exists a Right Linear Regular Grammar for L


(b) There exists a Left Linear Regular Grammar for L
(c) There exists a nfa with single final state
(d) There exists a dfa with single final state
(e) There exists a nfa without ԑ - move

Which are true?

(i) All are true (b) a, b, c are true


(c) a, b, c, e are true (d) a, b, d are true

7. Consider 2 scenarios:

C1: For DFA (ϕ, Ʃ, δ, qo, F),


if F = ϕ, then L = Ʃ*

C2: For NFA (ϕ, Ʃ, δ, qo, F),


if F = ϕ, then L = Ʃ*

Where F = Final states set


ϕ = Total states set

(a) Both are true (b) Both are False


(c) C1 is true, C2 is false (d) C1 is false, C2 is true

8. Consider this FA:

How many strings will be there in the complement of the language accepted by this Finite
Automata?

(a) Infinite (b) 2

2
(c) 3 (d) 0

9. In Programming language, an identifier has to be a letter followed by any number of letters or


digits. If L and D denotes the sets of letter and digits respectively, examine the correct
expressions?

(a) (L ∪ D)* (b) (L ∙ D)*


(c) L ∙ (L ∪ D)* (d) L ∙ (L ∙ D)*

10. Total number of DFA possible with 2 states q0 → start and non-final, q1 → final
over Ʃ = {a,b} is

(a) 16 (b) 32
(c) 48 (d) 64

11.

Ʃ = {0, 1}
L = Ʃ*
R = { On 1n such that n > 1}

Languages L ∪ R and R are respectively:

(a) Regular, Regular (b) Regular, Not Regular


(c) Not Regular, Not Regular (d) Not Regular, Regular

12.
L1 = { am | m ≥ 0}
L2 = { bm | m ≥ 0}

L1 ∙ L2 = ?

(a) { am bm, m ≥ 0} (b) {am bn, m, n ≥ 0}


(c) {am bn, m, n ≥ 1} (d) None of the above

13. Consider these statements:

S1: If a language is infinite, it has to be non-Regular.


S2: Let L be any language.

3
(L)∗ ≠ (L∗ )

(a) Both are True (b) Both are False


(c) S1 → True, S2 → False (d) S1 → False, S2 → True

14. Which of the following R.E. over Ʃ = {0, 1} denotes set of all strings not containing as sub-
string.

(a) 0* (0 + 1)* (b) 0* 1 0 1 0*


(c) 0* 1* 0 1 (d) 0* (1 0 + 1)*

15. Which of the following set can be recognized by DFA?

(a) Numbers 1, 2, 4, 8, . . . 2n written in binary


(b) Numbers 1, 3, 4, 8, . . . 2n written in unary
(c) Set of binary strings in which number of zeroes is same as number of 1’s
(d) Set {1, 101, 11011, 1110111, . . .}

You might also like