lOMoARcPSD|19891601

FLA-QB - This notes are very important.

Formal Language And Automata (SRM Institute of Science and Technology)

Studocu is not sponsored or endorsed by any college or university

Downloaded by althaf kader (althafkader02@gmail.com)
 lOMoARcPSD|19891601

18CSC301T - FORMAL LANGUAGE AND AUTOMATA

1. There are tuples in finite state machine.

a) 4
b) 5
c) 6
d) unlimited
Answer:b
2. Transition function maps.
a) Σ * Q -> Σ
b) Q * Q -> Σ
c) Σ * Σ -> Q
d) Q * Σ -> Q
Answer:d
3. Number of states require to accept string ends with 10.
a) 3
b) 2
c) 1
d) can’t be represented.
Answer:a
4. Extended transition function is .
a) Q * Σ* -> Q
b) Q * Σ -> Q
c) Q* * Σ* -> Σ
d) Q * Σ -> Σ
Answer:a
5. δ*(q,ya) is equivalent to .
a) δ((q,y),a)
b) δ(δ*(q,y),a)
c) δ(q,ya)
d) independent from δ notation
Answer:b
6. String X is accepted by finite automata if .
a) δ*(q,x) E A
b) δ(q,x) E A
c) δ*(Q0,x) E A
d) δ(Q0,x) E A
Answer:c
7. Languages of a automata is
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
Answer:a

Downloaded by althaf kader (althafkader02@gmail.com)

 lOMoARcPSD|19891601

8. Language of finite automata is.

a) Type 0
b) Type 1
c) Type 2
d) Type 3
Answer:d
9. Finite automata requires minimum number of stacks.
a) 1
b) 0
c) 2
d) None of the mentioned
Answer:b
10.Number of final state require to accept Φ in minimal finite automata.
a) 1
b) 2
c) 3
d) None of the mentioned
Answer:d
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
Answer:c
12.How many DFA’s exits with two states over input alphabet {0,1} ?
a) 16
b) 26
c) 32
d) 64
Answer:d
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.
d) All of the mentioned
Answer:a
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
Answer:b
15. FSM with output capability can be used to add two given integer in binary representation. This is

Downloaded by althaf kader (althafkader02@gmail.com)

 lOMoARcPSD|19891601

a) True
b) False
c) May be true
d) None of the mentioned
Answer:a

16.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
Answer : a

17.Regular grammar is
a) context free grammar
b) non context free grammar
c) english grammar
d) none of the mentioned
Answer : a
18. 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
Answer : d
19.Regular expressions are closed under
a) Union
b) Intersection
c) Kleen star
d) All of the mentioned
Answer : d
20. The set of all strings over ∑ = {a,b} in which all strings of a’s and b’s ending in bb is
a) ab
b) a*bbb
c) (a+b)* bb
d) All of these Answer: c)

21.Push down automata accepts which language

a) Context sensitive language
b) Context free language
c) Recursive language
d) None of these Answer: b)

Downloaded by althaf kader (althafkader02@gmail.com)

 lOMoARcPSD|19891601

22 A context free grammar G is in Chomsky normal form if every production is of the form
a) A → BC or A → A
b) A → BC or A → a
c) A → BCa or B → b
d) None of these Answer: b)

23. Which of the following statement is false?

a) A recursive language is also a regular language
b) A context free language is also a regular language
c) A context free language is also recursive enumerable language
d) Both (a) and (b) Answer: b)

24. A context free language is called ambiguous if

a) It has two or more leftmost derivations for some terminal string ѡ є L (G)
b) It has two or more leftmost derivations for some terminal string ѡ є L (G)
c) Both (a) and (b)
d) None of these Answer: c)

25. Which of the following statement is false?

a) The context free language can be converted into Chomsky normal form
b) The context free language can be converted into Greibach normal form
c) The context free language is accepted by pushdown automata
d) None of these Answer: d)

26. The language L={0ᵐ1ᵐ0ᵐ| m ≥ 1} is a

a) Regular language
b) Context free language
c) Both (a) and (b)
d) None of these Answer: d)

27. While converting the context free grammar into Greibach normal form, which of the following is not
necessary
a) Elimination of null production
b) Elimination of unit production
c) Converting given grammar in Chomsky normal form
d) None of these Answer: d)

28. The context free grammar S → A111|S1, A → A0 | 00 is

equivalent to a) {0ⁿ1ᵐ | n=2, m=3}
b) {0ⁿ1ᵐ | n=1, m=5}
c) {0ⁿ1ᵐ | n should be greater than two and m should be greater than four}
d) None of these Answer: a)

Downloaded by althaf kader (althafkader02@gmail.com)

 lOMoARcPSD|19891601

29. The context free grammar S → SS | 0S1 | 1S0 | ɛ generates

a) Equal number of 0’s and 1’s
b) Unequal number of 0’s and 1’s
c) Any number of 0’s followed by any number of 1’s
d) None of these Answer: a)

30. Which of the following statement is false?

a) In derivation tree, the label of each leaf node is terminal
b) In derivation tree, the label of all nodes except leaf nodes is a variable
c) In derivation tree, if the root of a sub tree is X then it is called –tree
d) None of these Answer: d)

31. Push down automata accepts which language

a) Context sensitive language
b) Context free language
c) Recursive language
d) None of these Answer: b)

32. A context free grammar G is in Chomsky normal form if every production is of the form
a) A → BC or A → A
b) A → BC or A → a
c) A → BCa or B → b
d) None of these Answer: b)

33. Which of the following statement is false?

a) A recursive language is also a regular language
b) A context free language is also a regular language
c) A context free language is also recursive enumerable language
d) Both (a) and (b) Answer: b)

34. A context free language is called ambiguous if

a) It has two or more leftmost derivations for some terminal string ѡ є L (G)
b) It has two or more leftmost derivations for some terminal string ѡ є L (G)
c) Both (a) and (b)
d) None of these Answer: c)

35. Which of the following statement is false?

a) The context free language can be converted into Chomsky normal form
b) The context free language can be converted into Greibach normal form
c) The context free language is accepted by pushdown automata
d) None of these Answer: d)

36. The language L={0ᵐ1ᵐ0ᵐ| m ≥ 1} is a

a) Regular language
b) Context free language
c) Both (a) and (b)
d) None of these Answer: d)

Downloaded by althaf kader (althafkader02@gmail.com)

 lOMoARcPSD|19891601

37. While converting the context free grammar into Greibach normal form, which of the following is not
necessary
a) Elimination of null production
b) Elimination of unit production
c) Converting given grammar in Chomsky normal form
d) None of these Answer: d)

38. The context free grammar S → A111|S1, A → A0 | 00 is

equivalent to a) {0ⁿ1ᵐ | n=2, m=3}
b) {0ⁿ1ᵐ | n=1, m=5}
c) {0ⁿ1ᵐ | n should be greater than two and m should be greater than four}
d) None of these Answer: a)

39. The context free grammar S → SS | 0S1 | 1S0 | ɛ generates

a) Equal number of 0’s and 1’s
b) Unequal number of 0’s and 1’s
c) Any number of 0’s followed by any number of 1’s
d) None of these Answer: a)

40. Which of the following statement is false?

a) In derivation tree, the label of each leaf node is terminal
b) In derivation tree, the label of all nodes except leaf nodes is a variable
c) In derivation tree, if the root of a sub tree is X then it is called –tree
None of these

41. A regular language over an alphabet ∑ is one that cannot be obtained from the basic
languages using the operation
a. Union
b. Concatenation
c. Kleene*
d. All of the mentioned

42. The number of elements in the set for the Language L={xϵ(∑r) *|length if x is at most 2}
and ∑={0,1} is _
a. 7
b. 6
c. 8
d. 5

43. Given: ∑= {a, b} L= {xϵ∑*|x is a string combination} ∑4 represents which among the
following
a. {aa, ab, ba, bb}
b. {aaaa, abab, ε, abaa, aabb}
c. {aaa, aab, aba, bbb}
d. {ε}

Downloaded by althaf kader (althafkader02@gmail.com)

 lOMoARcPSD|19891601

44. Mealy and Moore machine can be categorized as:

a. Inducers
b. Transducers
c. Turing Machines
d. Linearly Bounder Automata

45. A Language for which no DFA exist is a

a. Regular Language
b. Non-Regular Language
c. May be Regular
d. Cannot be said

46. Which of the following is not an example of finite state machine system?
a. Control Mechanism of an elevator
b. Combinational Locks
c. Traffic Lights
d. Digital Watches

47. Numbers of states require to accept string ends with 10.

a. 3
b. 2
c. 1
d. 0

48. L1= {w | w does not contain the string tr }

L2= {w | w does contain the string tr}
Given ∑= {t, r}, The difference of the minimum number of states required to form L1 and L2?
a. 0
b. 1
c. 2
d. Infinite

49. The total number of states to build the given language using DFA: L=
{w | w has exactly 2 a’s and at least 2 b’s}
a. 10
b. 11
c. 12
d. 13

50. Given Language: {x | it is divisible by 3}

The total number of final states to be assumed in order to pass the number constituting
{0, 1} is
a. 0
b. 1
c. 2
d. 3

Downloaded by althaf kader (althafkader02@gmail.com)

 lOMoARcPSD|19891601

51. Which of the following is same as the given DFA?

a) (0+1)*001(0+1)*
b) 1*001(0+1)*
c) (01)*(0+0+1)(01)*
d) (0+1)*
52. Which among the following cannot be accepted by a regular grammar?
a) L is a set of numbers divisible by 2
b) L is a set of binary complement
c) L is a set of string with odd number of 0
d) L is a set of 0n1n
53. Consider the languages L1 = φ and L2 = {1}. Which one of the following
represents L*1∪ L*1 L*2?
(A) {∈} (B)
{∈, 1}

(C) φ
(D) 1*
54. The non- Kleene Star operation accepts the following string of finite length over set
A = {0,1} | where string s contains even number of 0 and 1
a) 01,0011,010101
b) 0011,11001100
c) ε,0011,11001100
d) ε,0011,11001100

55. Transition function maps.

a. Σ * Q -> Σ
b. Q * Q -> Σ
c. Σ * Σ -> Q
d. Q * Σ -> Q

56. δ*(q,ya) is equivalent to .

a. δ((q,y),a)
b. δ(δ*(q,y),a)
c. δ(q,ya)

Downloaded by althaf kader (althafkader02@gmail.com)

 lOMoARcPSD|19891601

d. independent from δ notation

57. If we select a string w such that w∈L, and w=xyz. Which of the following portions cannot be an
empty string?
a. x
b. y
c. z
d. xz

58. Fill in the blank in terms of p, where p is the maximum string length in L.
Statement: Finite languages trivially satisfy the pumping lemma by having n =
a. p*1
b. p+1
c. p-1
d. p

59. Predict the analogous operation for the given language: A: {[p, q] | p
ϵ A1, q does not belong to A2}
a. A1-A2
b. A2-A1
c. A1.A2
d. A1+A2
60. e-transitions are
a. conditional
b. unconditional
c. input dependent
d. independent

61. RR* can be expressed in which of the forms:

a. R+
b. R-
c. R+ U R-
d. R

62. Simplify the following regular expression: ε+1*(011)

*(1*(011) *) *
a) (1+011) *
b) (1*(011) *)
c) (1+(011) *) *
d) (1011) *

63. Precedence of regular expression in decreasing order is

a) * , . , +
b) . , * , +
c) . , + , *
d) + , a , *

Downloaded by althaf kader (althafkader02@gmail.com)

 lOMoARcPSD|19891601

64. L and ~L are recursive enumerable then L is

a. Regular
b. Context free
c. Context sensitive
d. Recursive
65. Which of the following statements is false?
(A) Every NFA can be converted to an equivalent DFA
(B) Every non-deterministic Turing machine can
be converted to an equivalent deterministic
Turing machine
(C) Every regular language is also a context-free language
(D) Every subset of a recursively enumerable set is recursive

Downloaded by althaf kader (althafkader02@gmail.com)