Problem

  • For some string
  • There exists which represents in reverse
  • Let be the set of all backwards strings of
  • For example,
  • Prove that if is regular, then is also regular

Solution

We prove with Proof by Structural Induction Define as β€˜There exists a s.t

Base Case

We show that holds for

  1. Let
  2. Let
  3. Let

Induction Step

  • Let
  • Suppose IH
  • This means s.t and We need to show 3 cases: , ,
  • Case 1:
    • Then,
    • by IH
    • as order doesnt matter
  • Case 2:
    • Then, as swapping order of concatenation reverses the roder
    • by IH
  • Case 3:
    • Then, as order does not matter for
  • Then, by structural induction holds