Let M be a finite-state machine with n states. The input
Chapter 9, Problem 31(choose chapter or problem)
Let M be a finite-state machine with n states. The input alphabet is 506. Show that for any input sequence that is long enough, the output of M must eventually be periodic. What is the maximum number of inputs before periodic output begins? What is the maximum length of a period?
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