8. Draw a NFA that accepts all strings over Σ = {a,b} that have both aa and bb as substrings., 9. Convert the following NFA to a DFA. Draw the transition diagram.

Design a TM that recognizes a string containing aba as a substring.

1.Given that, L = { start of all strings over a, b }. Construct CFG from this language.2.Determine the FIRST and FOLLOW sets from the production rules you used to construct the parse table.       S --> A $       A --> - A B | id C       B --> - B | " "       C --> " " | id

4. Below is the state diagram of an NFA N over the alphabet Σ = {a,b}. Convert N into an equivalent DFA M. Give the state diagram of M. Show how you constructed M. a, b N a

Please help me with this, I'm stuck...

For each of the following languages give a regular expression that describes it. 1- A1 = {w|w is a non-empty string over E = {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}

a) Draw the diagram for a DFA that accepts any string over the alphabet {a,b} that contains an odd number of a's and an odd number of b's.   b) Is this regular expression equivalent to the DFA from part (a)? Briefly justify your choice. (ab|ba)(aa|bb)+(ab|ba)

Write a regular expression for a language over alphabet L = {0, 1} accepting all strings start with 01 and ending with 10. Convert the given regular expression into NFA and then convert the NFA to DFA.

1. For E = {a, b} give a DFA for all strings not containing aa substring.

Design a state diagram to recognize the form of strings described as follows using EBNF: -1* { } */ A |BIC.. | Z