Scribd
Upload
3 views

TOC--Q5

Toc new style questions 5

Uploaded by

khanzd029
Copyright
© © All Rights Reserved
Available Formats
Download as PDF, TXT or read online on Scribd
3 views

TOC--Q5

Toc new style questions 5

Uploaded by

khanzd029
Copyright
© © All Rights Reserved
Available Formats
Download as PDF, TXT or read online on Scribd
You are on page 1/ 4

THEORY OF COMPUTATION

AUTOMATA
1. There are ___________ tuples in finite state machine.

(a) 4 (b) 5
(c) 6 (d) unlimited

2. Transition function maps

(a) Ʃ*Q → Ʃ (b) Q*Q → Ʃ


(c) Ʃ*Ʃ → Q (d) Q*Ʃ → Q

3. Number of states required to accept string ends with 10

(a) 3 (b) 2
(c) 1 (d) can’t be represented

4. Extended transition function is

(a) Q*Ʃ* → Q (b) Q*Ʃ → Q


(c) Q* * Ʃ* → Ʃ (d) Q*Ʃ → Ʃ

5. δ*(q,cya) is equivalent to

(a) δ((q, y), a) (b) δ(δ*(q, y), a)


(c) δ(q, ya) (d) independent from δ notation

6. String X is accepted by finite automata if(A is the acceptance state)

(a) δ*(Q, x) ∈ A (b) δ(Q, x) ∈ A


(c) δ*(Q0, x) ∈ A (d) δ(Q0, x) ∈ A

7. Languages of an automata is

1
(a) If it is accepted by automata
(b) If it halts
(c) If automata touch final state in its life time
(d) All language are language of automata

8. Language of finite automata is

(a) Type 0 (b) Type 1


(c) Type 2 (d) Type 3

9. Finite automata requires minimum ____________ number of stacks.

(a) 1 (b) 0
(c) 2 (d) None of the mentioned

10. Number of final state require to accept ϕ in minimal finite automata

(a) 1 (b) 2
(c) 3 (d) None of the mentioned

11. Regular expression for all strings starts with ab and ends with bba is

(a) aba*b*bba (b) ab(ab)*bba


(c) ab(a+b)*bba (d) All of the mentioned

12. How many DFA’s exits with two states over input alphabet {0,1} ?

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

13. The basic limitation of finite automata is that

(a) It can’t remember arbitrary large amount of information


(b) It sometimes recognize grammar that are not regular
(c) It sometimes fails to recognize regular grammar

2
(d) All of the mentioned

14. Number of states require to simulate a computer with memory capable of storing ‘3’ words
each of length ‘8’.

(a) 3 * 2^8 (b) 2^(3*8)


(c) 2^(3+8) (d) None of the mentioned

15. FSM with output capability can be used to add two given integer in binary representation.
This is

(a) True (b) False


(c) May be true (d) None of the mentioned

16. How many strings of length less than 4 contains the language described by the regular
expression (x+y)*y(a+ab)*?

(a) 7 (b) 10
(c) 12 (d) 11

17. Which of the following is true?

(a) (01)*0 = 0(10)* (b) (0+1)*0(0+1)*1(0+1) = (0+1)*01(0+1)*


(c) (0+1)*01(0+1)*+1*0* = (0+1)* (d) All of the mentioned

18. A language is regular if and only if

(a) accepted by DFA (b) accepted by PDA


(c) accepted by LBA (d) accepted by Turing machine

19. Regular grammar is

(a) context free grammar (b) non-context free grammar


(c) english grammar (d) none of the mentioned

3
20. Let the class of language accepted by finite state machine be L1 and the class of languages
represented by regular expressions be L2 then

(a) L1 < L2 (b) L1 ≥ L2


(c) L1 U L2 = .* (d) L1 = L2

You might also like