Welcome! Log In Create A New Profile


Chapter 17 - CLosure under +, . and *

Posted by dve83 
Announcements Last Post
Announcement SoC Curricula 09/30/2017 01:08PM
Announcement Demarcation or scoping of examinations and assessment 02/13/2017 07:59AM
Announcement School of Computing Short Learning Programmes 11/24/2014 08:37AM
Announcement Unisa contact information 07/28/2011 01:28PM
Chapter 17 - CLosure under +, . and *
October 16, 2011 09:05AM
just got a question on this,

Its seems pretty easy to show that a language(s) L1 and L2 are closed under +, product and * (kleene closure),

but in our 2006 exam paprer they ask

1. Show the language L1L2 and
2. prove that it is correct (two way proof).

I need to know what they want from number 2. The number 1 is the proof in Cohen.

Danie van Eeden
avatar Re: Chapter 17 - CLosure under +, . and *
October 16, 2011 12:25PM
Danie, I think you'll find the phrase "two way proof" either in your study guide or in the exam tuts. Sorry I can't be more helpful than that right now. (I have my own dragons to slay).

It's this kind of proof from assertion A to assertion B ... A -> B (fill in an A and cool smiley

Followed by B -> A.

So in the end you should have A <-> B.

(The basics are old stuff, in other words.)

And memory deserts me there for now.
Re: Chapter 17 - CLosure under +, . and *
October 21, 2011 12:56AM
i think the lecturer added something like on the discussion forum...
Sorry, only registered users may post in this forum.

Click here to login