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.