I don't think so. Let the odd number be AnAn-1An-2...A3A2A1.
This number can be odd, if AnAn-1...A3A2 is odd and A1 is even (0/2) OR
AnAn-1...A3A2 is even and A1 is odd (1). So this clearly gives a simple
DFA.
let Qs be the start state and Qe is the state DFA enters when an even
number is seen
How about the language consisting of all the odd numbers. The binary of all odd numbers would be
(0+1)*1, which is regular. I don't think, in base 3, you could
represent it in a regular _expression_. I am not good at proofs - maybe
you can try and get it.
enjoy madi
mayurOn 1/17/06, pramod [EMAIL
