Draw a DFA B = {w is an element of {0}* and length of w is...

Question

Question

Draw a DFA

B = {w is an element of {0}* and length of w is divisible by either 3 or 5 }

engineering Computer-Science

Answer 1

Answer #1

Divisible by 3: 0, 3, 6, 9, 12, ...

Divisible by 5: 0, 5, 10, 15, ...

--------------------------------------
Hit the thumbs up if you are fine with the answer. Happy Learning!

Answer 2

Similar Homework Help Questions

Create a DFA for the language L = {w ∈ {0, 1}∗ : w is a...

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.
Part B - Automata Construction Draw a DFA which accepts the following language over the alphabet...

Part B - Automata Construction Draw a DFA which accepts the following language over the alphabet of {0,1}: the set of all strings such that the number of 0s is divisible by 2 and the number of 1s is divisible by 5. Your DFA must handle all intput strings in {0,1}*. Here is a methodical way to do this: Figure out all the final states and label each with the shortest string it accepts, work backwards from these states to...
Give a DFA for the following language over the alphabet Σ = {0, 1}: L={ w...

Give a DFA for the following language over the alphabet Σ = {0, 1}: L={ w | w starts with 0 and has odd length, or starts with 1 and has even length }. E.g., strings 0010100, 111010 are in L, while 0100 and 11110 are not in L.

Draw a DFA which accepts the following language over the alphabet of {0,1}: the set of...

Draw a DFA which accepts the following language over the alphabet of {0,1}: the set of all strings such that there are two consecutive 0s or the number of 1s is not divisible by 5. Your DFA must handle all intput strings in {0,1}*. (Hint: look at solution of previous question)
1(a)Draw the state diagram for a DFA for accepting the following language over alphabet {0,1}: {w...

1(a)Draw the state diagram for a DFA for accepting the following language over alphabet {0,1}: {w | the length of w is at least 2 and has the same symbol in its 2nd and last positions} (b)Draw the state diagram for an NFA for accepting the following language over alphabet {0,1} (Use as few states as possible): {w | w is of the form 1*(01 ∪ 10*)*} (c)If A is a language with alphabet Σ, the complement of A is...
Draw a dfa for a given language For Σ={a,b), draw a dfa that accepts the language....

Draw a dfa for a given language For Σ={a,b), draw a dfa that accepts the language. Clearly mark your start and final states. We were unable to transcribe this image

1. Design an NFA (Not DFA) of the following languages. a) Lw E a, b) lw...

1. Design an NFA (Not DFA) of the following languages. a) Lw E a, b) lw contain substring abbaab) b) L- [w E 10,1,2) lsum of digits in w are divisible by three) c) L-(w E {0,1,2)' |The number is divisible by three} d) The language of all strings in which every a (if there are any) is followed immediately by bb. e) The language of all strings containing both aba and bab as substrings. f L w E 0,1every...
Let L = {w element {0, 1}^* | w has odd parity}. And let f: {0,...

Let L = {w element {0, 1}^* | w has odd parity}. And let f: {0, 1}^* rightarrow {0, 1}^* be the function computed by a deterministic finite state transducer that does the following: for the first bit the DFT writes it out as is. Then for any bit it outputs a 1 if it is different than the previous bit and outputs a 0 if it is the same as the previous one. Produce DFA that accepts f(L).
Draw a DFA that accepts all binary strings of length 4 modulo 7.

Draw a DFA that accepts all binary strings of length 4 modulo 7.

1) Assume ∑ = {a, b}, construct a DFA to recognize: {w | number of a's...

1) Assume ∑ = {a, b}, construct a DFA to recognize: {w | number of a's in w ≥ 2 and number of b's in w ≤ 1}. (seven states) 2) Assume ∑ = {a, b}, construct a DFA to recognize: {w || w | ≥ 2, second to the last symbol of w is b}. (four states) 3) Write a regular expression for: All bit strings that contain at least three 1's.