Question

Q#1 Write the Regular Expression of the language L that will accept any string consisting entirely of b's and it will also accept any string in which the number of a's is divisible by 3. Also make its Finite Automata and remember that machine does not accepts null and the start and ending state cannot be same? (There is a clear representation of state number along with their sign and clearly represents character that's transition is taken place. Also label dead end states properly). Q#2 Consider a Language L that accepts all strings that have odd number of occurrences of the substring abc over the alphabet ={a, b, c}.Build a Finite Automata.(There is a clear representation of state number along with their sign and clearly represents character that's transition is taken place .Also label dead end states properly).Also justify your Finite Automata that it accepts the given Language and reject those strings which are not included in above Language. Hint: Final state can be more than 1.

          Q#1
Write the Regular Expression of the language L that will accept any string consisting entirely of b's and it will also accept any string in which the number of a's is divisible by 3. Also make its Finite Automata and remember that machine does not accepts null and the start and ending state cannot be same? (There is a clear representation of state number along with their sign and clearly represents character that's transition is taken place. Also label dead end states properly).

Q#2
Consider a Language L that accepts all strings that have odd number of occurrences of the substring abc over the alphabet ={a, b, c}.Build a Finite Automata.(There is a clear representation of state number along with their sign and clearly represents character that's transition is taken place .Also label dead end states properly).Also justify your Finite Automata that it accepts the given Language and reject those strings which are not included in above Language.

Hint: Final state can be more than 1.

Q#1
Write the Regular Expression of the language L that will accept any string consisting entirely of b's and it will also accept any string in which the number of a's is divisible by 3. Also make its Finite Automata and remember that machine does not accepts null and the start and ending state cannot be same? (There is a clear representation of state number along with their sign and clearly represents character that's transition is taken place. Also label dead end states properly).

Q#2
Consider a Language L that accepts all strings that have odd number of occurrences of the substring abc over the alphabet =a, b, c.Build a Finite Automata.(There is a clear representation of state number along with their sign and clearly represents character that's transition is taken place .Also label dead end states properly).Also justify your Finite Automata that it accepts the given Language and reject those strings which are not included in above Language.

Hint: Final state can be more than 1.

Added by Juan Carlos P.

Question

Please give Ace some feedback