Theory of Automata MCQs with Answers
Practice important Theory of Automata MCQs with answers and explanations.
Chapter: 1
Q1:
What is the plural of automaton?
A. Automation
B. Automata
C. Autonomous
D. Auto
Correct Answer:
B
Chapter: 1
Q2:
Which of the following is a formal language?
A. Syntactic language
B. Semantic language
C. Informal language
D. None of the above
Correct Answer:
A
Chapter: 1
Q3:
What does the Greek letter Σ represent in automata theory?
A. Number of states
B. Set of operators
C. Alphabet
D. Set of languages
Correct Answer:
C
Chapter: 1
Q4:
The string 'abab' belongs to which alphabet?
A. {a,b}
B. {i,j,k}
C. {0,1}
D. {B,aB,bab,d}
Correct Answer:
A
Chapter: 1
Q5:
Which of the following is a valid alphabet?
A. Σ1 = {B, aB, bab, d}
B. Σ2 = {B, Ba, bab, d}
C. Both
D. None
Correct Answer:
A
Chapter: 1
Q6:
What is a valid string over the alphabet Σ = {a, b}?
A. ababab
B. Λ
C. xx
D. -
Correct Answer:
A
Chapter: 1
Q7:
How is a null string represented?
A. Λ
B. Σ
C. Rev(s)
D. ΛΣ
Correct Answer:
A
Chapter: 1
Q8:
A string is defined as a concatenation of which elements?
A. Operators
B. Variables
C. Symbols
D. Letters
Correct Answer:
D
Chapter: 1
Q9:
What is the reverse of the string 'abc' over Σ = {a,b,c}?
A. abc
B. cba
C. bac
D. cab
Correct Answer:
B
Chapter: 1
Q10:
In automata theory, what is the definition of a word?
A. A combination of symbols
B. A valid alphabet
C. A string belonging to a language
D. A series of valid alphabets
Correct Answer:
C
Chapter: 1
Q11:
A language defined by the descriptive definition uses which of the following?
A. Conditions imposed on its words
B. Automaton
C. Regular expressions
D. Lexical analyzer
Correct Answer:
A
Chapter: 1
Q12:
The string 'aaa' belongs to which language defined over Σ={a}?
A. INTEGER
B. EVEN-EVEN
C. EVEN
D. L of strings of odd length
Correct Answer:
D
Chapter: 1
Q13:
What type of language is PALINDROME?
A. Language of prime strings
B. Language of reverse strings
C. Language with an equal number of a's and b's
D. Language where Rev(s) = s
Correct Answer:
D
Chapter: 1
Q14:
Fill in the blank: A finite non-empty set of symbols is called an _______.
A. Alphabet
B. String
C. Word
D. Automaton
Correct Answer:
A
Chapter: 1
Q15:
Fill in the blank: A _______ string is denoted by the Greek letter Λ.
A. Long
B. Null
C. Valid
D. Ambiguous
Correct Answer:
B
Chapter: 1
Q16:
Fill in the blank: The _______ of a string is the number of letters in the string.
A. Reverse
B. Length
C. Alphabet
D. Validity
Correct Answer:
B
Chapter: 1
Q17:
Fill in the blank: The alphabet Σ = {a,b} contains the letters _______.
A. a, ab
B. a, b
C. a, b, ab
D. a, b, c
Correct Answer:
B
Chapter: 2
Q18:
What does the Kleene Star Closure generate over Σ?
A. Only finite strings
B. Only null strings
C. All strings, including null
D. Only non-empty strings
Correct Answer:
C
Chapter: 2
Q19:
What is the result of the Plus Operation (Σ+) over an alphabet Σ?
A. Includes the null string
B. Excludes the null string
C. Only generates finite strings
D. Only generates infinite strings
Correct Answer:
B
Chapter: 2
Q20:
Which of the following is NOT part of the recursive definition of a language?
A. Specifying some basic words
B. Defining rules for more words
C. Allowing any string in the language
D. Limiting words to specific rules
Correct Answer:
C