Welcome! Log In Create A New Profile

Oct 2006 Exam Question 6

Posted by brettc

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

Forums Messages New

brettc

Oct 2006 Exam Question 6
October 31, 2009 03:05PM

Registered: 16 years ago
Posts: 184
Rating: 0

For questions 6ii and 6iii, is it sufficient to give my answer (yes or now) and then mention theorem 50 and 51 to justify my answer?

*edit* It would be awesome if they'd give us the answers to the 2006 exam.

Reply Quote

stevenv

Re: Oct 2006 Exam Question 6
October 31, 2009 03:14PM

Registered: 18 years ago
Posts: 613
Rating: 0

I think you can say yes or no and simply state that any language accepted by a 2PDA can be accepted by a (ii) 3PDA and (iii) TM.

2PDA = nPDA = PM = TM (page 491)

Reply Quote

brettc

Re: Oct 2006 Exam Question 6
October 31, 2009 03:22PM

Registered: 16 years ago
Posts: 184
Rating: 0

Thanks, that's what theorem's 50 and 51 say smiling smiley

Reply Quote

stevenv

Re: Oct 2006 Exam Question 6
October 31, 2009 04:22PM

Registered: 18 years ago
Posts: 613
Rating: 0

Quite right, but for 2 marks I wouldn't say too much cool smiley

Reply Quote

Reanie

Re: Oct 2006 Exam Question 6
October 31, 2009 04:28PM

Registered: 18 years ago
Posts: 3,015
Rating: 5

I just browsed through the 2006 & 2007 forums - hoping to get any info on the 2006 exam - nothing.
We'll have to figure it out on our own.

Reply Quote

brettc

Re: Oct 2006 Exam Question 6
October 31, 2009 06:12PM

Registered: 16 years ago
Posts: 184
Rating: 0

Another question regarding this exam...

What do you guys find to be the easiest way to find the Accept(T), Loop(T) and Reject(T) of a TM?

Reply Quote

stevenv

Re: Oct 2006 Exam Question 6
October 31, 2009 06:47PM

Registered: 18 years ago
Posts: 613
Rating: 0

I don't think there's really any specific method to find that, I try to imagine different words being run on the TM while isolating what causes those words to be either accepted, rejected or loop. After that its finding the pattern that defines the words that fit into each category i.e. all words that start with a double b end up looping.

Reply Quote

brettc

Re: Oct 2006 Exam Question 6
October 31, 2009 06:54PM

Registered: 16 years ago
Posts: 184
Rating: 0

I'll be leaving that question for last for sure

Reply Quote

Reanie

Re: Oct 2006 Exam Question 6
October 31, 2009 07:03PM

Registered: 18 years ago
Posts: 3,015
Rating: 5

Each year you get the previous year's exam paper. So, why aren't we getting 2008's exam paper?
I wrote last year, but the only thing I remember is that the format was the same as the previous year's.