hw07-2.pdf - HW Solution CS\/ECE 374 Algorithms Models of Computation Spring 2019 Version 1.0 Submitted by \u2022 Rishu Bagga rbagga2 \u2022 Charlie Jung

hw07-2.pdf - HW Solution CS/ECE 374 Algorithms Models of...

This preview shows page 1 - 2 out of 3 pages.

HW Solution CS/ECE 374: Algorithms & Models of Computation, Spring 2019 Version: 1.0 Submitted by: Rishu Bagga : rbagga2 Charlie Jung : charlie4 James Ickes : jickes2 HW 7 Due on Wednesday, March 6, 2019 at 10am CS/ECE 374: Algorithms & Models of Computation, Spring 2019 Version: 1.1 19 ( 100 pts. ) Superstring theory.You are given aDFAM= (Q,Σ, δ, s, A)withnstates, where|Σ|=O(1).For two stringsx, yΣ*, the stringxis asuperstringofy, if one can delete characters fromxandgety.Letwbe a given input string withmcharacters.19.A.(25 pts.) Letq, q0Qbe two states ofM. Prove, that the shortest stringw00, such thatδ*(q, w00) =q0is of length at mostn-1.

  • Left Quote Icon

    Student Picture

  • Left Quote Icon

    Student Picture

  • Left Quote Icon

    Student Picture