Hallo! I submitted online registration 9 Feb 2013, still awaiting. How are the rest of you guys / gals doing? already registered. If anyone can please email me some material (old tutorial letters / articles) from 2012 that I can start reading through it would be greatly appreciated. I would like to get an early start this year. Thank you, Ianby ian.coetzer - INF4883
Hi, Okay, Question 2 of Assignment 2.... How does one describe the relationship that defines the predicate? I have found examples and given them and described what the function should do, but I don't have a clue of how to define the relationships?? Does anyone have a small example that shows how to define this? Thanks, Ianby ian.coetzer - COS451G
Hi, The procedure that we must write should yield output like this: if List = , the procedure order(List, Result) outputs: Result = [(1,a), (2,b), (3,c), (4,d)]. If the input list is different - see following example - is this the desired output if List = , the procedure order(List, Result) outputs: Result = [(3,a), (1,b), (4,c), (2,d)]. Or should it still be: Result = [(1,aby ian.coetzer - COS451G
Hi, I recently obtained the electronic version of this entire textboox. So I am using that on my smartphone + laptop. I did however purchase the textbook brand new earlier this year. If you want you can buy it from me? make me an offer It is still brand new and in excellent condition since I have used the electronic version since starting with my first assignment.by ian.coetzer - COS451G
I have just finised question 1 a) ending up with almost 1,600 words spannig 3 full pages , moving on to 1 b) now ...by ian.coetzer - INF482X
Hi There, How long (pages) should the essay be for question 1 a) in assignment 1?by ian.coetzer - INF482X
Hello fellow students, I'm desperately looking for an eBook (pdf etc.) of this modules 2011 textbook. Anyone know where i can find a copy? I have even tried Amazon, eBay etc. but cannot find and purchase one there?by ian.coetzer - COS451G
Hello fellow students, I'm desperately looking for an eBook (pdf etc.) of this modules 2011 textbook. Anyone know where i can find a copy? I have even tried Amazon, eBay etc. but cannot find and purchase one there?by ian.coetzer - COS416D
aaaai, this exam also had me depressed afterwards and still does. I battled to remember everything that I studied, and also failed to remember anything about heuristics because this is what I studied as per last tutorial: I suppose heuristics falls under 12. since it is a way of evaluating a system I sincerely hope i pass this exam, studied almost 4 days flat for this one. 1. Human-compuby ian.coetzer - INF320E
Kewl, I hope we passed well! I feel confident but will only jump up and down in joy when i see the actual results in front of me in black and white. Can't wait. Now I have to start reading that enormous textbook on HCI before the 24th, at least it is a good read and no mathematical proofs to remember just content and knowing which content they are looking for when they ask questions in thby ian.coetzer - COS301Y
Hey Reanie, do you mean that you explained it instead of drawing it? It was an easier one that 2PDA simply push x onto stack 1 and push x twice onto stack 2 and then for the second clump of letters read and pop for each once. and for the last clump of letters read and pop once since stack 2 now contains 2 * n X'sby ian.coetzer - COS301Y
whoops! where we suppose to EXPLAIN the 2PDA??? aaaagh I drew it!by ian.coetzer - COS301Y
I enjoyed it! was very stressed in the beginning and just just finished in time had 5 minutes to spare. managed to do everything and my diagrams all went well did not get stuck there, i though that some of them like the big TM and 2PDA etc. may stump me but i managed.by ian.coetzer - COS301Y
Okay thanks even though (a+b)* will never be reached it could still form part of a valid input string! Just checked tut 104 ... phew other answers i gave seemed ok, except for Question 5 which still have me bowled out for a duck! must still check the other chap's solution diagram have not yet tried to trace through it. *** Question 7 - revised solution *** cheersby ian.coetzer - COS301Y
Another one, what if the input string was aab? it would result in first convert it to aaa and then remove the last a resulting in aa. How did this successfully perform the function that we were given to prove? aab to aa? that surely is not doing an n + n, but rather leaving only n on the tape. the tape should consist of aaaa remember from given example output!by ian.coetzer - COS301Y
mmm but with two 'b's in the input string ADDER crashes in state (1). so I don't really think 'b' are allowed. In ADDER ONE 'b' is allowed since it MEANS something - it is used as a separator between TWO clumps of 'a's. If there is more than one 'b' it crashes since adder EXPECTS there to only be one. also what if the input string isby ian.coetzer - COS301Y
Okay, I see one can use two characters but the input string will only have one character and the output string 'should' only have the same character as well. BUT during execution one can append new charaters or even overwrite existing characters with other characters ...by ian.coetzer - COS301Y
Didn't they say use unary encoding? Adder assumes that a 'b' is used to separate two clumps of 'a's It does so by added the first say n clump of a's to the second m clump of 'a's by overwriting the separating 'b' with an 'a' then finally it removes the last 'a' on the input tape since the 'b' that was overwritten bby ian.coetzer - COS301Y
lol, I see it too now! I would like it if the forums allowed one to embed images. It used t support this about 3 years ago when i posted image tags it would embed them so that one could see the image and did not have to click on the link.by ian.coetzer - COS301Y
Has anyone come up with a solution to this problem? example TM yet, any takers?by ian.coetzer - COS301Y
Lol, I think malberts is trying to tell us that there are 7 possible cases in which the suitable word can be broken up, since vxy <= 2^pby ian.coetzer - COS301Y
Great! thanks for spotting that error would have cost me a point or two! Will have to remember that in the exams, I do sometimes assum that the machine knows that the next Read will result in an empty / null character being red. But we have to force the machine to carry on reading since it cannot predict what the next character will be and that it IS in fact at the end of the tape! Here isby ian.coetzer - COS301Y
Okay, last one, comments please. *** Question 9 *** thxby ian.coetzer - COS301Y
Still not able to figure out examples, other than those ones on Page 574 given inside the actual diagram. *** Question 8 - Corrected *** In other words would this be accepted as answers: Regular Language = {null} Context-Free Language = {a^n b^n} Recursively Enumerable Language = L Recursive Language = MATHISONby ian.coetzer - COS301Y
LOL, yup messed this one up! Will post a correction, sorry.by ian.coetzer - COS301Y
Hi, I like your one better, changed the full solution: *** Question 7 ***by ian.coetzer - COS301Y
Okay, first stab at 8. i) Does this make sense? *** 2006, 8 i) *** *** Question 8 - Corrected *** Still trying to figure out how to create example languages for each scenario??by ian.coetzer - COS301Y
Please see if these Accept, Loop definitions are correct. My Attempt @ Question 7 *** Question 7 - revised solution *** thxby ian.coetzer - COS301Y
Sorry for starting another thread just noticed now that a previous one with almost exactly the same name exists ...by ian.coetzer - COS301Y
Oh no! Yup I spent this whole morning trying to find a way to do this one on a whole bunch of papers, my study is a mess right now thanks to that question. I came so close a couple of times but then found out that my tests failed. Should we not try and simplify this one by writing for example a "#" in the beginning and wherever we read a consecutive ba make the second letter A, thby ian.coetzer - COS301Y