Question: BASED ON DISCRETE MATHS AND COMPUTER SCIENCE PROBLEM 1 (8 marks) Write regular expressions describing the following languages over the alphabet {0,1}. 1. The words
BASED ON DISCRETE MATHS AND COMPUTER SCIENCE

PROBLEM 1 (8 marks) Write regular expressions describing the following languages over the alphabet {0,1}. 1. The words containing 00 and ending with 10. 2. The words containing 00 and ending with 01. 3. The words containing exactly one occurrence of 11. Hint: ((0/10)*) = all words in which any 1 is followed by 0. = 4. Who invented regular expressions
Step by Step Solution
There are 3 Steps involved in it
Get step-by-step solutions from verified subject matter experts
