Clive]]>

(a + b + abba)*(a + b)which is correct. However, the study guide further simplifies it to

(a + b)*(a + b)Can anyone tell me how they managed to simplify that?]]>

Protip: If i remember correctly, we got example 6 in the 2005 exam :)

btw, i don't get the algebra in example 5: they say log 2 = 1 ??]]>

S.]]>

Does anybody have any helpful tips on how to make this easier to understand?]]>

For example, I'm looking at this example at the moment.

Formulate the induction principle for the set P of all positive numbers greater than or equal to 5. Then apply the induction principle to prove that 2n-3 <= 2^(n-2)

So I define a subset of P called A and I check that 5 is an element of A.

Then I go on to prove that k+1 is in A by assuming that k is in A. And it's here that I get unstuck.

The model answer is as follows

line 1) LHS = 2(k+1) - 3 = 2k + 2 - 3 = (2k-3) + 2

line 2) <= 2^(k-2) + 2 (from induction assumption)

line 3) <= 2.(2^(k-2)) (because the smallest value for 2^(k-2), k = 5 is 2^(5-2) = 8 and 2*8=16 > 10)

line 4) = 2^(1 + k - 2)

line 5) = 2^((k + 1) - 2)

Hence A = P and we conclude that 2n-3 <= 2^(n-2) for all n >= 5

Please could someone explain to me where the 2. comes from in line 3 and why the +2 goes away.

Many many many thanks,

Rachel]]>

I'm just starting today...aaahhh yes good ole finite automata, nice to see you again...I've missed you...like a hole in the head.

Clive]]>

We are an SAP Special expertise partner and have a need to grow our capacity.

Please visit www.consnet.co.za for more information.]]>

Obviously calculated incorrectly!?]]>

I have also worked out (what I think to be correct), the FA for L

Is this wrong - am I missing something?

Thanks in advance.

(for some reason the subscript isn't working correctly - is it just me, or everyone having the problem?)]]>

Pencil markings in my second hand textbook obscure the question. Please could someone confirm that Problem 7 is the following:

L1 = (b + ab) * (a + ÃŽâ€º)

L2 = (a + b)*aa(a + b)*

I also can't tell if there's supposed to be a line above the last part of L2.

Many thanks :)

Rachel]]>

If someone would be so kind to post questions 2, 4 and 5

from the correct (1997) text book it would be much appreciated.

thanks.]]>

I'm having trouble with assignment 3, question 3. I've worked out the regular expression for the language, to make it easier to work out what the NFA must look like. But I just can't figure out a 4 state NFA to fit the regular expression (I presume when they say 4 state, it means 4 states including the first "-" state?).

If someone could maybe help me out with how to the start off the NFA (I'm not looking for the answer), it would be greatly appreciated.

Regards]]>

My FA's etc made sorta sense once I worked out the answers, but I still don't get induction fully. Even though I also did mat111 last year.]]>

Why not I ask?

Hell, I was invited to one that would show me how to do "hello World" in Delphi:S]]>

Thanks in advance.]]>

8-)...]]>