Regular Expression From a DFA
I am trying to create a finite automate that would accept any strings that have at least to 0s but reject all strings that have consecutive 0s. I have designed a deterministic finite automaton (DFA) for this purpose but am having trouble generating a regex
from it.
The checked boxes are accepting states.
Thank you!
discrete-mathematics automata regular-expressions
edited Dec 27 '18 at 9:52
dantopa
6,42932042
asked Dec 1 '18 at 0:49
Gonzalez Rojo
241
add a comment |
I am trying to create a finite automate that would accept any strings that have at least to 0s but reject all strings that have consecutive 0s. I have designed a deterministic finite automaton (DFA) for this purpose but am having trouble generating a regex
from it.
The checked boxes are accepting states.
Thank you!
discrete-mathematics automata regular-expressions
edited Dec 27 '18 at 9:52
dantopa
6,42932042
asked Dec 1 '18 at 0:49
Gonzalez Rojo
241
See also cs.stackexchange.com/questions/2016/…
– obscurans
Dec 1 '18 at 2:48
You can simplify the DFA: states start and s0 are equivalent, and states s4 and s6 are equivalent.
– Peter Taylor
Dec 6 '18 at 18:48
add a comment |
I am trying to create a finite automate that would accept any strings that have at least to 0s but reject all strings that have consecutive 0s. I have designed a deterministic finite automaton (DFA) for this purpose but am having trouble generating a regex
from it.
The checked boxes are accepting states.
Thank you!
discrete-mathematics automata regular-expressions
edited Dec 27 '18 at 9:52
dantopa
6,42932042
asked Dec 1 '18 at 0:49
Gonzalez Rojo
241
I am trying to create a finite automate that would accept any strings that have at least to 0s but reject all strings that have consecutive 0s. I have designed a deterministic finite automaton (DFA) for this purpose but am having trouble generating a regex
from it.
The checked boxes are accepting states.
Thank you!
discrete-mathematics automata regular-expressions
discrete-mathematics automata regular-expressions
edited Dec 27 '18 at 9:52
dantopa
6,42932042
asked Dec 1 '18 at 0:49
Gonzalez Rojo
241
edited Dec 27 '18 at 9:52
dantopa
6,42932042
asked Dec 1 '18 at 0:49
Gonzalez Rojo
241
edited Dec 27 '18 at 9:52
dantopa
6,42932042
edited Dec 27 '18 at 9:52
dantopa
6,42932042
edited Dec 27 '18 at 9:52
dantopa
6,42932042
6,42932042
asked Dec 1 '18 at 0:49
Gonzalez Rojo
241
asked Dec 1 '18 at 0:49
Gonzalez Rojo
241
asked Dec 1 '18 at 0:49
Gonzalez Rojo
241
241
See also cs.stackexchange.com/questions/2016/…
– obscurans
Dec 1 '18 at 2:48
You can simplify the DFA: states start and s0 are equivalent, and states s4 and s6 are equivalent.
– Peter Taylor
Dec 6 '18 at 18:48
add a comment |
See also cs.stackexchange.com/questions/2016/…
– obscurans
Dec 1 '18 at 2:48
You can simplify the DFA: states start and s0 are equivalent, and states s4 and s6 are equivalent.
– Peter Taylor
Dec 6 '18 at 18:48
See also cs.stackexchange.com/questions/2016/…
– obscurans
Dec 1 '18 at 2:48
See also cs.stackexchange.com/questions/2016/…
– obscurans
Dec 1 '18 at 2:48
You can simplify the DFA: states start and s0 are equivalent, and states s4 and s6 are equivalent.
– Peter Taylor
Dec 6 '18 at 18:48
You can simplify the DFA: states start and s0 are equivalent, and states s4 and s6 are equivalent.
– Peter Taylor
Dec 6 '18 at 18:48
add a comment |
1 Answer
1
active
oldest
votes
Consider the regular expression $1^*01^+0(1^+0)^*1^*$.
answered Dec 1 '18 at 1:52
Joey Kilpatrick
1,181422
add a comment |
Your Answer
StackExchange.ifUsing("editor", function () {
return StackExchange.using("mathjaxEditing", function () {
StackExchange.MarkdownEditor.creationCallbacks.add(function (editor, postfix) {
StackExchange.mathjaxEditing.prepareWmdForMathJax(editor, postfix, [["$", "$"], ["\\(","\\)"]]);
});
});
}, "mathjax-editing");
StackExchange.ready(function() {
var channelOptions = {
tags: "".split(" "),
id: "69"
};
initTagRenderer("".split(" "), "".split(" "), channelOptions);
StackExchange.using("externalEditor", function() {
// Have to fire editor after snippets, if snippets enabled
if (StackExchange.settings.snippets.snippetsEnabled) {
StackExchange.using("snippets", function() {
createEditor();
});
}
else {
createEditor();
}
});
function createEditor() {
StackExchange.prepareEditor({
heartbeatType: 'answer',
autoActivateHeartbeat: false,
convertImagesToLinks: true,
noModals: true,
showLowRepImageUploadWarning: true,
reputationToPostImages: 10,
bindNavPrevention: true,
postfix: "",
imageUploader: {
brandingHtml: "Powered by u003ca class="icon-imgur-white" href="https://imgur.com/"u003eu003c/au003e",
contentPolicyHtml: "User contributions licensed under u003ca href="https://creativecommons.org/licenses/by-sa/3.0/"u003ecc by-sa 3.0 with attribution requiredu003c/au003e u003ca href="https://stackoverflow.com/legal/content-policy"u003e(content policy)u003c/au003e",
allowUrls: true
},
noCode: true, onDemand: true,
discardSelector: ".discard-answer"
,immediatelyShowMarkdownHelp:true
});
}
});
Sign up or log in
StackExchange.ready(function () {
StackExchange.helpers.onClickDraftSave('#login-link');
});
Sign up using Google
Sign up using Facebook
Sign up using Email and Password
Post as a guest
Required, but never shown
StackExchange.ready(
function () {
StackExchange.openid.initPostLogin('.new-post-login', 'https%3a%2f%2fmath.stackexchange.com%2fquestions%2f3020867%2fregular-expression-from-a-dfa%23new-answer', 'question_page');
}
);
Post as a guest
Required, but never shown
1 Answer
1
active
oldest
votes
1 Answer
1
active
oldest
votes
active
oldest
votes
active
oldest
votes
Consider the regular expression $1^*01^+0(1^+0)^*1^*$.
answered Dec 1 '18 at 1:52
Joey Kilpatrick
1,181422
add a comment |
Consider the regular expression $1^*01^+0(1^+0)^*1^*$.
answered Dec 1 '18 at 1:52
Joey Kilpatrick
1,181422
add a comment |
Consider the regular expression $1^*01^+0(1^+0)^*1^*$.
answered Dec 1 '18 at 1:52
Joey Kilpatrick
1,181422
Consider the regular expression $1^*01^+0(1^+0)^*1^*$.
answered Dec 1 '18 at 1:52
Joey Kilpatrick
1,181422
answered Dec 1 '18 at 1:52
Joey Kilpatrick
1,181422
answered Dec 1 '18 at 1:52
Joey Kilpatrick
1,181422
answered Dec 1 '18 at 1:52
Joey Kilpatrick
1,181422
1,181422
add a comment |
add a comment |
Thanks for contributing an answer to Mathematics Stack Exchange!
- Please be sure to answer the question. Provide details and share your research!
But avoid …
- Asking for help, clarification, or responding to other answers.
- Making statements based on opinion; back them up with references or personal experience.
Use MathJax to format equations. MathJax reference.
To learn more, see our tips on writing great answers.
Some of your past answers have not been well-received, and you're in danger of being blocked from answering.
Please pay close attention to the following guidance:
- Please be sure to answer the question. Provide details and share your research!
But avoid …
- Asking for help, clarification, or responding to other answers.
- Making statements based on opinion; back them up with references or personal experience.
To learn more, see our tips on writing great answers.
Sign up or log in
StackExchange.ready(function () {
StackExchange.helpers.onClickDraftSave('#login-link');
});
Sign up using Google
Sign up using Facebook
Sign up using Email and Password
Post as a guest
Required, but never shown
StackExchange.ready(
function () {
StackExchange.openid.initPostLogin('.new-post-login', 'https%3a%2f%2fmath.stackexchange.com%2fquestions%2f3020867%2fregular-expression-from-a-dfa%23new-answer', 'question_page');
}
);
Post as a guest
Required, but never shown
Sign up or log in
StackExchange.ready(function () {
StackExchange.helpers.onClickDraftSave('#login-link');
});
Sign up using Google
Sign up using Facebook
Sign up using Email and Password
Post as a guest
Required, but never shown
Sign up or log in
StackExchange.ready(function () {
StackExchange.helpers.onClickDraftSave('#login-link');
});
Sign up using Google
Sign up using Facebook
Sign up using Email and Password
Post as a guest
Required, but never shown
Sign up or log in
StackExchange.ready(function () {
StackExchange.helpers.onClickDraftSave('#login-link');
});
Sign up using Google
Sign up using Facebook
Sign up using Email and Password
Sign up using Google
Sign up using Facebook
Sign up using Email and Password
Post as a guest
Required, but never shown
Required, but never shown
Required, but never shown
Required, but never shown
Required, but never shown
Required, but never shown
Required, but never shown
Required, but never shown
Required, but never shown
See also cs.stackexchange.com/questions/2016/…
– obscurans
Dec 1 '18 at 2:48
You can simplify the DFA: states start and s0 are equivalent, and states s4 and s6 are equivalent.
– Peter Taylor
Dec 6 '18 at 18:48