# DFA & RE from descriptive definition of given regular language

I am trying to make the DFA and RE of a regular language which is define on the alphabet = {1,0} and all the strings present in these languages have exactly one 010 substring in them.

Some strings which are accepted by the above regular language are;

{010, 0100, 0101, 1010, 0010 .......0101110.....}

In the above strings there is only one 010 substring. If there is more than one 010 substring in a string such as.

{01010, 01011010... }

then the DFA of the above language should not accept that string.

If someone provide me ony DFA of the above lang. then i would be able to make the RE by state elimination. Or if someone provide me the RE of the above lang. then i could make the DFA by other kleene theorem.

My work: I made the following DFA for that language;

This DFA is accepting all the strings like 010, 0100, 0101, 1010, 0010.... and its also rejecting the string with more than 010 like 01010. But with that its rejecting 0101110 string which is part of the language.

Note: I go through the question which is already on the CS stackexchange as previously my question was marked duplicate. This question is about "How we can prove that a given language is regular or not". But in my question i have provided the descriptive definition of a regular language. And i am trying to get its RE or DFA.

• Please don't delete and re-ask your question. That question contains general techniques that suffice to enable you to construct such a DFA. See, e.g., cs.stackexchange.com/a/11051/755. I was hoping you would study those techniques, try applying them to your problem, and then show us your attempts and where you got stuck. We discourage questions that are the statement of an exercise-style problem (find a DFA for this regular language) with a request for someone to solve the exercise for you.
– D.W.
Commented Mar 8, 2019 at 18:48
• I added my work and also added that where i stuck. Please remove your downvote Sir if you think question is valid now! Commented Mar 9, 2019 at 8:48

You can always use the current state of the automaton to remember the last three characters you've seen. Now, you can implement two phases. In the first phase, you're happy if you're ever in the situation where the last three characters were $$010$$. In the second phase, you become unhappy if you ever see $$010$$ again.
• The two phases are very similar so, if you can do the first, you should be able to adapt it to do the second. Both of them are looking for $010$ and they only differ in how they react to that. Commented Mar 9, 2019 at 10:19