For each of the following languages give a regular expression that describes it. 1- A1 = {w|w is a non-empty string over = (0, 1}}. 2- A2 = {w € {ab}* ]w contains an odd number of as and each a is followed by at least one b}. 3- A3 = {w € {ab}*| w does not contain three a's}

Write a program in C programming language that takes two arguments at the command line, both strings. The program checks to see whether or not the second string is a substring of the first (without using the substr -- or any other library -- function). One caveat: any * in the second string can match zero or more characters in the first string, so if the input were abcd and the substring was a*c, then it would count as a substring. Also, include functionality to allow an asterisk to be taken literally if preceded by a \, and a \ is taken literally except when preceding an asterisk.

The following two languages over {0,1} L1: All strings that begin in '00' L2:  All strings that have the substring '1' embedded.

5. Design an FSM over the alphabet (0, 1) that accepts strings that do NOT have 111 as a substring. For example: 1011 and 000110 will be accepted but 011100 and 111101 will not.

Write a regular expression to describe each of the following languages. Example: {w € (a, b)* : w has both aa and bb as substrings} Regular expression: (a U b)* aa (a U b)* bb (a U b)* U (a U b)* bb (a U b)* aa (a U b)*

I need help creating this C++ parser program that follows these rules in the image below.