Question: Please Answer This Question Correctly And Completely OR YOU WILL GET DOWNVOTED b) Construct the regular expression for the following languages: 1) L1={ All binary
b) Construct the regular expression for the following languages: 1) L1={ All binary strings over ={0,1}, where each string contains at least three characters and third character should be zero } 2) L2= \{All binary strings over ={0,1}, where each string start with 0 and has odd length } c) Write a CFG for all even numbers using alphabets ={0,1,2,,9}. Hint: every even number ends at 0,2,4,6,8
Step by Step Solution
There are 3 Steps involved in it
Get step-by-step solutions from verified subject matter experts
