College Code

Dr K V SUBBA REDDY INSTITUTE OF TECHNOLOGY

(Approved by AICTE, New Delhi & Affiliated to JNTUA, Ananthapuramu)
ISO9001:2008 Certified Institution FH
DEPARTMENT OF COMPUTER SCIENCE AND ENGINEERING
II B.Tech II Semester(R15) I Mid -Term Examination, Feb/Mar-2019
Subject : Formal Languages and Automata Theory (15A05404) Time: 20
Min
Max Marks : 10M Exam Type: Objective Date: 14/03/2020

Reg, No: F H A 0

ANSWER ALL THE FOLLOWING QUESTIONS. 20 X 1/2 = 10M

i)Multiple choice questions:

1. In transition diagram of FA, the final state is represented as [ ]

A) Single Circle B) Star C) Double Circle D) None
2. Which is correct for δ(q,ab)? [ ]
A) δ(q,a) U δ(q,b) B) δ(δ(q,a),b) C) δ(q,a),b D) None
3. In the Moore Machine , the output depends on [ ]
A) present state B) final state C) input symbol D) initial state
4. If 00000111 is a binary string, then length of given string |w| is [ ]
A) 4 B) 8 C) 5 D) 7
5. If there are two sets A and B , then their intersection is denoted by [ ]
A) A U B B) A ∩ B C) A + B D) None
6. For a Moore machine, the states are labelled with the ____ in a transitional diagram [ ]
A) state name only B) output only C) state name, D) None
output
7. The maximum number of state of a DFA converted from an NFA with n states is [ ]
A) n B) n2 C) 2n D) n+1
8. A Grammar consists of _______ tuples [ ]
A) Four B) Five C) Three D) Two
9. Finite automata is defined as [ ]
A) M={Q,∑,δ,q0,F} B) M={Q,∑,q0,F} C) M={Q,δ,q0,F} D) None
10. Regular expressions are closed under [ ]
A)Union B)Intersection C) Kleen Closure D) All

ii)True OR False:

11. If L is a regular language and F is a finite language (i.e., a language with a finite number of words), then

L U F must be a regular language [True/False]

12. If L is a regular language, then {wwR : w ɛ L} must be a regular language [True/False]

13. anbm, where the alphabet is a, b and n ≥ 0, m ≥ 0, is a regular language [True/False]

14. (a∗b∗)∗ = (a + b)∗ [True/False]

15. (r + s) ∗ = r ∗ + s ∗ [True/False]

iii)Fill in The Blanks:

16. Let the input alphabet be ∑ = {0}, then ∑* =

17. The regular expression for the regular set {2,22,222,........ } is

18. What is the solution for the equation R= Q + RP

19. RR* can be expresses as _____________

20. The Finite Automata accepts ____________________ language.