1. Engineering
  2. Computer Science
  3. create a dfa for the language l w ...

Question: create a dfa for the language l w ...

Question details

Create a DFA for the language L = {w ∈ {0, 1}∗ : w is a set of strings with 011 as a substring AND is not divisible by 3 }. First, create two separate DFAs for is a set of strings with 011 as a substring and not divisible by 3. Then, create the intersection between those DFAs by using the product construction. Show all your work. Hint: Use the least amount of states as possible.

Solution by an expert tutor
Blurred Solution
This question has been solved
Subscribe to see this solution