Let = {a,b}. For each k 1, let Dk be the language
Chapter , Problem 1.62(choose chapter or problem)
Let = {a,b}. For each k 1, let Dk be the language consisting of all strings that have at least one a among the last k symbols. Thus Dk = a( )k1. Describe a DFA with at most k+1 states that recognizesDk in terms of both a state diagram and a formal description.
Unfortunately, we don't have that question answered yet. But you can get it answered in just 5 hours by Logging in or Becoming a subscriber.
Becoming a subscriber
Or look for another answer