Theory of Automata MCQs with Answers
Practice important Theory of Automata MCQs with answers and explanations.
Multiple Choice Questions
Q381: The string "aa" is accepted by an FA. What does this imply about the language of the FA?
- A: The language is empty
- B: The FA accepts finite words
- C: The FA accepts some strings
- D: The language is infinite
View Answer
C
Q382: If an FA has N states, what is the maximum length of the word that needs to be tested to determine if it accepts an infinite language?
- A: N
- B: 2N
- C: N^2
- D: 3N
View Answer
B
Q383: What is a sufficient condition for an FA to accept no word?
- A: The FA has no initial state
- B: The FA has no final state
- C: The FA has an infinite loop
- D: The FA has multiple initial states
View Answer
B
Q384: The Pumping Lemma is used to prove that ______.
- A: FAs accept infinite languages
- B: FAs reject certain words
- C: FAs accept finite languages
- D: FAs accept regular expressions
View Answer
A
Q385: A regular expression that contains the symbol * usually defines ______.
- A: finite language
- B: infinite language
- C: empty language
- D: singular language
View Answer
B
Q386: In a given FA, which of the following is NOT accepted by the FA?
- A: aa
- B: baa
- C: bbb
- D: aaa
View Answer
C
Q387: If an FA with N states accepts no word, how many strings of length less than N should be tested?
- A: m^N
- B: N^m
- C: mN + mN+1
- D: m^2N
View Answer
C
Q388: What does CFG stand for in automata theory?
- A: Context Free Grammar
- B: Computer Functional Grammar
- C: Complex Finite Grammar
- D: Control Flow Grammar
View Answer
A
Q389: What are the symbols called that cannot be replaced by anything in CFG?
- A: NonTerminals
- B: Terminals
- C: Productions
- D: Start symbols
View Answer
B
Q390: Which of the following generates a Context-Free Language (CFL)?
- A: DFA
- B: CFG
- C: PDA
- D: NFA
View Answer
B