Language acceptance by Deterministic Finite Automata (DFAs)
How many states can the automaton transition to upon reading input?
How many transition functions does a DFA have?
Can a DFA run infinitely?
Can a DFA be constructed to count the parity of a given input symbol?