Given a deterministic finite-state automaton M = (S, /, f,
Chapter 12, Problem 12.3.15(choose chapter or problem)
Given a deterministic finite-state automaton M = (S, /, f, so, F), use structural induction and the recursive definition of the extended transition function f to prove that f(s , xy) = f(f(s, x), y) for all states s E S and all strings x E I* and y E /*.
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