Questions & Results
Q1 of 5Multiple ChoiceAccuracy60s · 1 pt
A DFA reads an input string. When is the string accepted?
A When the DFA is in an accepting state after reading the entire string✓ Correct B When the DFA passes through an accepting state at any point C When the DFA returns to the start state D When the DFA visits every state at least once 160 / 189 answered · 95% correct
Q2 of 5Multiple ChoiceAccuracy45s · 1 pt
Which statement about the states of a finite automaton is true?
A An FA must have at least one final state B An FA has exactly one start state and zero or more final states✓ Correct C The start state can never be a final state D An FA can have several start states 171 / 189 answered · 72% correct
Q3 of 5Multiple ChoiceAccuracy60s · 1 pt
An FA over {0, 1} accepts strings with an odd number of 0s and an odd number of 1s. Each state tracks whether the counts of 0s and 1s so far are even or odd. How many states does it need?
182 / 189 answered · 89% correct
Q4 of 5Multiple ChoiceAccuracy45s · 1 pt
What is a dead (trap) state in a DFA?
A An accepting state with no outgoing transitions B A state with no incoming transitions D A non-accepting state whose transitions all loop back to itself✓ Correct 186 / 189 answered · 82% correct
Q5 of 5Multiple ChoiceAccuracy60s · 1 pt
Let L1 = {a, ab} and L2 = {b, ε}. Which string is NOT in the concatenation L1L2?
187 / 189 answered · 90% correct
Score Distribution
Score (points) →