AMCAT Practice Test
AMCAT Automata and Formal Languages
Which of the following languages can be recognized by a Deterministic Finite Automaton (DFA)?
Select your answer
A
The set of all strings over {a, b} with an equal number of a's and b's
B
The set of all strings over {a, b} that end with 'ab'
C
The set of all palindromes over {a, b}
D
The set of all strings of the form a^n b^n where n >= 0
Hint
