

damita or kittie, female, 23 years young, lives with her husband, home owner, has three fur-babies Arthur, Kitty & Onion, adores web design (online since 2002!), works online (part-time) and is a full-time uni student studying Computer Science.



I finding it alot better than alogrithms that I did last term but still it makes my head hurt, my notebook is fullof little circles trying to figure out these last two questions:
8. The language of all strings consisting of the symbols 0 and 1 such that
the string contains an even number of occurrences of the symbol 1.
9. The language of all strings consisting of the symbols 0 and 1 such
that when the string is interpreted as a binary number it is exactly
divisible by 3.
Maybe I'll get it working soon but after this I have to get some programming done as I have some workshop work to do...
It's all uni work today, fingers crossed I understand some more this term..








