November 19, 2009.ppt

Theory of Computation Lecture 19: Calculations on Strings IV November 19, 2009 Theory of Computation Lecture 19: Calculations on Strings IV * Numerical Representation of Strings Correspondingly, we define the following: For x ? N, let w be the string in ?* which represents x in base l. Let w’ be obtained from w by crossing out all of the symbols that belong to ? – A, so w’ ? A*. We write DOWNCHANGEn,l(x) for the number which w’ represents in base n. Example: DOWNCHANGE2,6(109) = 5 The representation of 109 in base 6 is s2s6s1. We cross out the s6 and get s2s1. In base 2, s2s1 represents the number 5. November 19, 2009 Theory of Computation Lecture 19: Calculations on Strings IV * Numerical Representation of Strings UPCHANGEn,l and DOWNCHANGEn,l are actually primitive recursive functions, but now we will just show that they are computable. This program computes UPCHANGEn,l: [A] IF X = 0 GOTO E Z ← LTENDn(X) // Z receives leftmost symbol X ← LTRUNCn(X) // removes this symbol from x Y ← l ? Y + Z // add to output GOTO A November 19, 2009 Theory of Computation Lecture 19: Calculations on Strings IV * Numerical Representation of Strings Let us look at the computation of UPCHANGE2,10(12) iteration by iteration (string s2s1s2): [A] IF X = 0 GOTO E Z ← LTENDn(X) X ← LTRUNCn(X) Y ← l ? Y + Z GOTO A 0. Z = 0, Y = 0, X = 12 Z = 2, Y = 2, X = 4 Z = 1, Y = 21, X = 2 Z = 2, Y = 212, X = 0 Result: 212 November 19, 2009 Theory of Computation Lecture 19: Calculations on Strings IV * Numerical Representation of Strings This program computes DOWNCHANGEn,l: [A] IF X = 0 GOTO E Z ← LTENDl(X) // Z receives leftmost symbol X ← LTRUNCl(X) // removes this symbol from x IF Z n GOTO A // check if we must cross out Z Y ← n ? Y + Z // if not, ad