Question: Exercise 2.2.8: Let A be a DFA and a a particular input symbol of A, such that for all states q of A we have

Exercise 2.2.8: Let A be a DFA and a a particular input symbol of A, such that for all states q of A we have 8(q, a) = q. a) Show by induction on n that for all n > 0, (q, an) = 9, where an is the string consisting of n a's. b) Show that either {a}* C L(A) or {a}* n L(A) = 0
Step by Step Solution
There are 3 Steps involved in it
Get step-by-step solutions from verified subject matter experts
