Theory of Automata MCQs with Answers
Practice important Theory of Automata MCQs with answers and explanations.
Multiple Choice Questions
Q301: Fill in the blank: In the Mealy machine, the output is determined using the relation output = __________.
- A: (input) OR (old B)
- B: (input) NAND (old A AND old B)
- C: (input) AND (old A OR old B)
- D: old A AND (input)
View Answer
A
Q302: What happens to the state q0 when reading the letter 0?
- A: The new state becomes (1,0)
- B: The new state remains (0,0)
- C: The new state becomes (0,1)
- D: The new state becomes (1,1)
View Answer
A
Q303: Fill in the blank: The delay box introduces __________ in the sequential circuit.
- A: States
- B: Outputs
- C: Transitions
- D: Inputs
View Answer
A
Q304: When running the string '01101110' on the machine, which state will the machine end up in?
- A: q0
- B: q1
- C: q2
- D: q3
View Answer
D
Q305: Fill in the blank: The NAND box provides the __________ of Boolean AND output.
- A: Addition
- B: Subtraction
- C: Complement
- D: Multiplication
View Answer
C
Q306: What is a regular language?
- A: A language that can be expressed by a regular expression
- B: A language that can be expressed by a context-free grammar
- C: A language that can be expressed by a Turing machine
- D: A language that can be expressed by a finite automaton
View Answer
A
Q307: If L1 and L2 are regular languages, which of the following operations will also produce a regular language?
- A: L1 + L2
- B: L1L2
- C: L1*
- D: All of the above
View Answer
D
Q308: Fill in the blank: A TG accepting L1 + L2 can be constructed using _______.
- A: L1 and L2 expressed by TG1 and TG2
- B: Only L1 expressed by TG1
- C: Only L2 expressed by TG2
- D: Any two random TGs
View Answer
A
Q309: What is the complement of a language L?
- A: The language of all strings over the alphabet not in L
- B: The language of all strings in L
- C: The union of L and its complement
- D: The intersection of L and its complement
View Answer
A
Q310: According to Kleene's theorem, what happens to an FA when final and non-final states are swapped?
- A: It will accept the complement of the original language
- B: It will accept the union of the original language
- C: It will accept the intersection of the original language
- D: It will accept the original language
View Answer
A