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..
Sure Enough -Damita.Net | Personal blog of a full-time computer student & part-time wannabe housewife | www.digital-damita.net | Online since 2002 should get a bunch of stake plainly due to the fact it is interesting understanding.
ReplyDelete