Assignment Questions
Posted by Anonymous User
| 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 |
|
Assignment Questions April 27, 2006 10:50PM |
Can someone please tell me if these are the right questions as i am working from the draft edition at the moment:
2.1
Write regular expressions for the following languages: You may use
either Perl notation or the minimal 'algebraic' notation of Section 2.3, but
make sure to say which one you are using. By 'word', we mean an alphabetic
string separated from other words by white space, any relevant punctuation,
line breaks, etc.
a. the set of all alphabetic strings.
c. the set of all strings with two consecutive repeated words (for example
'Humbert Humbert' and 'the the' but not 'the bug' or 'the big bug'
.
e. all strings which start at the beginning of the line with an integer (i.e.
1,2,3... 10... 10000...) and which end at the end of the line with a word.
g. write a pattern which places the first word of an English sentence in a
register. Deal with punctuation.
2.6
Write an FSA for time-of-day expressions like eleven o'clock, twelve-
thirty, midnight, or a quarter to ten and others.
2.9
Give an algorithm for negating a deterministic FSA. The negation of an
FSA accepts exactly the set of strings that the original FSA rejects (over the
same alphabet), and rejects all the strings that the original FSA accepts.
2.10
Why doesn't your previous algorithm work with NFSAs? Now extend
your algorithm to negate an NFSA.
2.1
Write regular expressions for the following languages: You may use
either Perl notation or the minimal 'algebraic' notation of Section 2.3, but
make sure to say which one you are using. By 'word', we mean an alphabetic
string separated from other words by white space, any relevant punctuation,
line breaks, etc.
a. the set of all alphabetic strings.
c. the set of all strings with two consecutive repeated words (for example
'Humbert Humbert' and 'the the' but not 'the bug' or 'the big bug'
.
e. all strings which start at the beginning of the line with an integer (i.e.
1,2,3... 10... 10000...) and which end at the end of the line with a word.
g. write a pattern which places the first word of an English sentence in a
register. Deal with punctuation.
2.6
Write an FSA for time-of-day expressions like eleven o'clock, twelve-
thirty, midnight, or a quarter to ten and others.
2.9
Give an algorithm for negating a deterministic FSA. The negation of an
FSA accepts exactly the set of strings that the original FSA rejects (over the
same alphabet), and rejects all the strings that the original FSA accepts.
2.10
Why doesn't your previous algorithm work with NFSAs? Now extend
your algorithm to negate an NFSA.
Sorry, only registered users may post in this forum.