Automata Theory Objective Questions Answers | Page-3

Questions
21 TM is more powerful than FSM because
A it has no finite state control
B the tape movement is confined to one direction
C it has the capability to remember arbitrary long sequences of input symbols
D none of the above

Answer: Option [C]
22 Choose the correct statements.
A A ={anbn | n = 0,1,2,3,………} is a regular language.
B L(A*B*) ∩ B gives the set A.
C The set B, consisting of all strings made up of only a’s and b’s having equal number of a’s and b’s defines a regular language.
D None of the above

Answer: Option [B]

⭐ Make GKSeries Your Preferred Source on Google

Add GKSeries as Preferred Source
23 The word 'formal' in formal languages means
A they are unnecessary, in reality
B the symbols used have well-defined meaning
C only the form of the string of symbols is significant
D none of the above

Answer: Option [C]
24 The major difference between a Moore and a Mealy machine is that
A the output of the former depends only on the present state
B the output of the former depends only on the current input
C the output of the former depends on the present state and the current input
D none of the above

Answer: Option [A]
25 Choose the correct statements.
A Any given Mealy machine has an equivalent Moore machine.
B Any given Moore machine has an equivalent Mealy machine.
C Moore and Mealy machines are FSM's with output capability.
D All of the above

Answer: Option [D]
26 Which of the following pairs of regular expressions are equivalent?
A x* and x*x
B 1(01)* and (10)*1
C x(xx)* and (xx)*x
D all of the above

Answer: Option [D]
27 An FSM can be considered a TM

Choose the correct statements.

A of finite tape length, without rewinding capability and unidirectional tape movement
B of finite tape lengths rewinding capability and unidirectional tape movement
C of finite tape length, rewinding capability and bidirectional tape movement
D of finite tape length, without rewinding capability and bidirectional tape movement

Answer: Option [A]
28 The language of all words (made up of a’s and b’s) with at least two a’s can be described by the regular expression
A b*ab*a(a+b)*
B (a+b)*ab*a(a+b)*
C (a+b)*a(a+b)*a(a+b)*
D all of the above

Answer: Option [D]
29 The following CFG
S → aS | bS | a | b

is equivalent to the regular expression

A (a+b)*
B (a+b)(a+b)*
C (a+b)*(a+b)
D All of the above

Answer: Option [D]
30 Choose the correct statements.
A All languages can be generated by CFG.
B Any regular language has an equivalent CFG.
C Some non-regular languages can’t be generated by any CFG.
D (B) and (C)

Answer: Option [D]
ADRE 3.0 Complete Study Material