Question: Question 1. 17 marks] Write a regular expression for each of the following langunges over the alphabet ={0,1}. a) Strings that have zeros and ones
Question 1. 17 marks] Write a regular expression for each of the following langunges over the alphabet ={0,1}. a) Strings that have zeros and ones in double (0011, 110011, 00001100). c, 011 and 10100 do not belong to the language. (1 mark) b) Strings that starts and ends with zeros in double ( 0.10100.00100) or starts and ends with ones in double (11011, 1101011), and the middle part could be empty or any string. 6, 1100, 1001 and 000 do not belong to the language. ( 1 mark) c) Consider the language that is expressed by (01+1) c.1) Express in English that language ( 1 mark) c.2) Convert the regular expression to an NFA (a graph only) (2 marks) c.3) Convert the resulted NFA to a DFA (graph + conversion details) (2 marks)
Step by Step Solution
There are 3 Steps involved in it
Get step-by-step solutions from verified subject matter experts
