Learn More
Proof (Lemma 1). By induction on the length of. For jj = 0 or 1 the statement holds by the construction of the next state function. Assume that the statement holds for jj = k. Forjj = k + 1 , let = , where jj =. Let r be the state of D reached from s on. A state q in t is labelled as \Good" if and only if all of its predecessors in r (all states of N that(More)
  • 1