Announcements Last Post
Announcement : Programming Students at UNISA School of Computing 06/19/2019 02:01PM
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
avatar Ass 04 Q 01
June 23, 2008 11:29AM

I assume we need to build the FA's.
Do need to see the steps?

Re: Ass 04 Q 01
June 24, 2008 09:42AM
Yes, in any solution you get marks for steps which is correct (or partially correct). If you just give the final step and it is wrong you do not get any marks.
Anonymous User
Re: Ass 04 Q 01
July 02, 2008 07:07AM
Question of builing FAs for Q1

Must the FAs contain reject states or only the minimum states that represent the regular expression?
Re: Ass 04 Q 01
July 04, 2008 10:52AM
As can be seen in problems 2&4 on pp122, 124 of the study guide, you ignore the reject states when you derive the regular expression.
Sorry, only registered users may post in this forum.

Click here to login