Note: In the formulae below recall
,the language with one string, the string with no symbols, and
is the "language with no
strings."
______________________________________________________________________
_________________________________________________________________
_________________________________________________________________
____________________________________________________________________________
Additional Assignment: Due September 22
Problems 1.31 and 1.32 (Please verify the problem numbers. Problem 1.31 begins
"For any string
w=ww
......w
,
the reverse of w......"