Welcome!
Log In
Create A New Profile
Home
>
2010
>
COS301Y
> Topic
Advanced
2006 Q2
Posted by
Rey
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
Rey
2006 Q2
October 29, 2010 10:35PM
Registered: 18 years ago
Posts: 163
Rating: 0
Question 2 (2006)
bit rusty
Reply
Quote
louisrdev
Re: 2006 Q2
October 30, 2010 07:55PM
Registered: 14 years ago
Posts: 20
Rating: 0
Agreed, I found the same solution.
Reply
Quote
35994908
Re: 2006 Q2
October 31, 2010 11:19AM
Registered: 16 years ago
Posts: 50
Rating: 0
how would we prove the correctness of this machine?
Reply
Quote
louisrdev
Re: 2006 Q2
October 31, 2010 01:03PM
Registered: 14 years ago
Posts: 20
Rating: 0
That is a completely different story, luckily the question does not require us to prove correctness of the machine.
Reply
Quote
Rey
Re: 2006 Q2
October 31, 2010 01:21PM
Registered: 18 years ago
Posts: 163
Rating: 0
Stated something like this:
Given Language L, will it be accepted by a given PDA and vise versa?
Isn't this a Decidability problem? What theorem was this?
Reply
Quote
Newer Topic
Older Topic
Print View
RSS
Sorry, only registered users may post in this forum.
Click here to login