Formal Languages And Automation Theory MCQs
Set III
Q1. Which of the following is a correct statement?
a) Moore machine has no accepting states ✔
b) Mealy machine has accepting states
c) We can convert Mealy to Moore but not vice versa
d) All of the mentioned
Answer is a) Moore machine has no accepting states
Explanation : Statement a and b is correct while c is false. Finite machines with output have no accepting states and can be converted within each other.
Q2. What is the output for the given language? Language: A set of strings over ∑= {a, b} is taken as input and it prints 1 as an output “for every occurrence of a, b as its substring. (INPUT: abaaab)
a) 0010001 ✔
b) 0101010
c) 0111010
d) 0010000
Answer is a) 0010001
Explanation : The outputs are as per the input, produced.
Q3. Finite automata needs minimum _______ number of stacks.
a) 0 ✔
b) 1
c) 2
d) None of the mentioned
Answer is a) 0
Explanation : The minimum number of stacks in finite automata is 0
Q4. Two finite states are equivalent if
a) Both are final states ✔
b) Both are non-final states
c) both have same number of states as well as transitions
d) Both a & b
Answer is d) Both a & b
Explanation : For explanation Join the discussion below
Q5.L={ε, a, aa, aaa, aaaa,……..} is represented by ______________
a) a* ✔
b) a+
c) Both a & b
d) None
Answer is a) a*
Explanation : Here in this expression * denotes any number of a
Q6. In mealy machine, the O/P depends upon?
a) State
b) Previous State
c) State and Input ✔
d) Only Input
Answer is c) State and Input
Explanation : It is already defined in the defination of Mealy Machine
Q7. The following mealy machine outputs which of the following?
a) 9’s Complement
b) 2’s Complement ✔
c) 1’s Complement
d) 10’s Complement
Answer is b) 2’s Complement
Explanation : The input can be taken in form of a binary string and can be verified.
Q8. The following grammar
G = (N, T, P, S)
N = {S, A, B, C}
T = {a, b, c}
P : S ? aS
A ? bB
B ? cC
C ? a is
a) is type 3 ✔
b) is type 2 but not type 3
c) is type 1 but not type 2
d) is type 0 but not type 1
Answer is a) is type 3
Explanation : For explanation Join the discussion below
Q9. The following grammar
G = (N, T, P, S)
N = {S, A, B, C, D, E}
T = (a, b, c}
P : S ? ABCD
BCD ? DE
D ? aD
D ? a
E ? bE
E ? c is
a) is type 3
b) is type 2 but not type 3
c) is type 1 but not type 2
d) is type 0 but not type 1 ✔
Answer is d) is type 0 but not type 1
Explanation : For explanation Join the discussion below
Q10. The ratio of number of input to the number of output in a mealy machine can be given as:
a) 1
b) n: n+1 ✔
c) n+1: n
d) None of the mentioned
Answer is a) 1
Explanation : The number of output here follows the transitions in place of states as in Moore machine.
Q11. The major difference between Mealy and Moore machine is about:
a) Output Variations ✔
b) Input Variations
c) Both
d) None of the mentioned
Answer is a) Output Variations
Explanation : Mealy and Moore machine vary over how the outputs depends on prior one (transitions) and on the latter one(states).
Q12. Mealy and Moore machine can be categorized as:
a) Inducers
b) Transducers ✔
c) Turing Machines
d) Linearly Bounder Automata
Answer is b) Transducers
Explanation : Both Mealy and Moore are collectively called Tranducers
Q13. An e-NFA is ___________ in representation.
a) Quadruple
b) Quintuple ✔
c) Triple
d) None of the mentioned
Answer is b) Quintuple
Explanation : An e-NFA consist of 5 tuples: A=(Q, S, d, q0. F)
Note: e is never a member of S.
Q14. The number of final states we need as per the given language? Language L: {an| n is even or divisible by 3}
a) 1
b) 2 ✔
c) 3
d) 4
Answer is b) 2
Explanation : For explanation Join the discussion below
Q15. Which of the following does not belong to input alphabet if S={a, b}* for any language?
a) a
b) b
c) e ✔
d) none of the mentioned
Answer is c) e
Explanation : Explanation: The automaton may be allowed to change its state without reading the input symbol using epsilon but this does not mean that epsilon has become an input symbol. On the contrary, one assumes that the symbol epsilon does not belong to any alphabet.
If you have any doubts join the discussion below ,our Moderator will reply to your Queries
Recommended MCQs
Formal Languages And Automation Theory MCQs With Answers - Set I
Formal Languages And Automation Theory MCQs With Answers - Set II
Formal Languages And Automation Theory MCQs With Answers - Set IV
Formal Languages And Automation Theory MCQs With Answers - Set V
Formal Languages And Automation Theory MCQs With Answers - Set VI
Formal Languages And Automation Theory MCQs With Answers - Set VII
Java MCQs with Answers Set III
Informatica MCQs with Answers Set I
Informatica MCQs with Answers Set II
Informatica MCQs with Answers Set III
Informatica MCQs with Answers Set IV
Informatica MCQs with Answers Set V
Informatica MCQs with Answers Set VI
Computer Organization and Architecture MCQs with Answers Set I
Computer Organization and Architecture MCQs with Answers Set II
Computer Organization and Architecture MCQs with Answers Set III
