WorksheetsQuiz on Automata Theory
Total questions: 30
Worksheet time: 28mins
What is Automata Theory primarily concerned with?
Designing physical robots
Abstract machines and computation
Database management
Network protocols
Who emphasized the need for a mathematical theory of automata?
Alan Turing
John von Neumann
Noam Chomsky
Claude Shannon
An automaton with a finite number of states is called:
Pushdown Automaton
Turing Machine
Finite Automaton
Infinite Automaton
What is a "symbol" in automata theory?
A mathematical equation
The smallest building block of a string
A state transition
A programming variable
The set of all possible symbols in a language is called:
String
Alphabet
Grammar
Lexicon
Which of the following is a valid string over Σ = {0, 1}?
012
ε (empty string)
1010
Both b and c
The length of the string "automata" is:
6
7
8
9
In automata theory, strings must always be:
Infinite
Finite
Random
Numeric
The reverse of the string "abc" is:
abc
cba
bca
acb
Concatenating "ab" with "cd" results in:
abcd
adbc
acbd
cdab
The empty string is denoted by:
∅
ε
λ
Both b and c
The length of the empty string is:
0
1
Undefined
Infinite
How many prefixes does the string "101" have (including ε)?
3
4
6
8
A proper prefix of "banana" is:
"banana"
"ban"
"ana"
Both a and b
The number of proper suffixes of "hello" is:
5
6
4
3
Which of the following is a suffix of "automata"?
"auto"
"mata"
"tom"
"out"
Which of these is an infinite string (invalid in automata)?
"0101"
"ε"
"111..."
"a"
If w = "ab" and wᵀ is its reverse, then wwᵀ is:
"abab"
"abba"
"baab"
"aabb"
The concatenation of "ε" and "xyz" is:
"εxyz"
"xyz"
"ε"
Invalid operation
A palindrome is a string that reads the same backward as forward. Which of these is a palindrome?
"abc"
"madam"
"hello"
"world"
The alphabet Σ = {A, T, C, G} is used to model:
Binary numbers
DNA sequences
English words
Arithmetic operations
The number of possible strings of length 2 over Σ = {0, 1} is:
2
4
8
Infinite
Which of the following is NOT a symbol in Σ = {a, b, c}?
a
b
d
ε
The Kleene star (Σ*) represents:
All finite strings over Σ
Only the empty string
Infinite strings
Single-symbol strings
The language accepting all strings ending with "00" over Σ = {0, 1} is an example of a:
Regular language
Context-free language
Recursive language
Undecidable language
T/F: Automata theory allows infinite-length strings.
T/F: The empty string (ε) is a valid string in any alphabet.
T/F: "Proper suffix" includes the string itself.
T/F: The reverse of "ε" is "ε".
T/F: The alphabet Σ = {0, 1} can generate the string "2".
