Question
a. Let {, , , . . . , } be an alphabet. Construct regular expressions for the following languages i. The set of words
a. Let {, , , . . . , } be an alphabet. Construct regular expressions for the following languages
i. The set of words which are zero or more repetitions of the letter .
ii. The set of words in part (i), followed by one or more repetitions of words or .
iii. The set of words in part (ii), followed by one repetition of followed by zero or more repetitions of . [6 marks]
b. Give three NFA which accept the set of words described by the three regular expressions in your answer to Question 1a (i), (ii) and (iii). [7 marks]
c. Give an example of a nondeterministic finite automaton (NFA) that is not a deterministic finite automaton (DFA). The NFA should have at least four states and be over alphabet with at least three letters. Give a brief explanation why the automaton is not a DFA. [6 marks]
d. Give three words over alphabet {, , }, which are recognised by the following regular expression: (|) (|) + () [6 marks]
Step by Step Solution
There are 3 Steps involved in it
Step: 1
Get Instant Access to Expert-Tailored Solutions
See step-by-step solutions with expert insights and AI powered tools for academic success
Step: 2
Step: 3
Ace Your Homework with AI
Get the answers you need in no time with our AI-driven, step-by-step assistance
Get Started