Oct 2006 Exam Question 8.

Posted by ian.coetzer
Announcements Last Post
SoC Curricula 09/30/2017 01:08PM
Demarcation or scoping of examinations and assessment 02/13/2017 07:59AM
School of Computing Short Learning Programmes 11/24/2014 08:37AM
Unisa contact information 07/28/2011 01:28PM
 Oct 2006 Exam Question 8. November 02, 2009 05:06PM Registered: 13 years ago Posts: 137 Rating: 0
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??
 Re: Oct 2006 Exam Question 8. November 02, 2009 05:25PM Registered: 14 years ago Posts: 613 Rating: 0
Surely this is the wrong way around? Look at page 574
 Re: Oct 2006 Exam Question 8. November 02, 2009 05:26PM Registered: 13 years ago Posts: 137 Rating: 0
LOL, yup messed this one up!
Will post a correction, sorry.
 Re: Oct 2006 Exam Question 8. November 02, 2009 05:44PM Registered: 13 years ago Posts: 137 Rating: 0
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 = MATHISON
 Re: Oct 2006 Exam Question 8. November 03, 2009 12:31PM Registered: 12 years ago Posts: 673 Rating: -1
I'd make the regular language something like (aa)* and write out MATHISON, L = {blah blah blah} rather than just giving the name.

--
"A man is the less likely to become great the more he is dominated by reason: few can achieve greatness - and none in art - if they are not dominated by illusion." Mr. Doctor
Sorry, only registered users may post in this forum.