Mixing
Give a state diagram for an NFA whose language L = …
$begingroup$
L = {w ∈ {0,1,2} *: w is a ternary representation of an integer that is a multiple of 3 but not a multiple of 9}
I've written a DFA accepting multiples of 3, but I'm not sure how I should proceed. Any help would be very much appreciated, thank you.
computer-science automata
edited Feb 2 at 3:35
YuiTo Cheng
2,4064937
asked Feb 2 at 2:26
Hayden MorganHayden Morgan
12
$endgroup$
add a comment |
$begingroup$
L = {w ∈ {0,1,2} *: w is a ternary representation of an integer that is a multiple of 3 but not a multiple of 9}
I've written a DFA accepting multiples of 3, but I'm not sure how I should proceed. Any help would be very much appreciated, thank you.
computer-science automata
edited Feb 2 at 3:35
YuiTo Cheng
2,4064937
asked Feb 2 at 2:26
Hayden MorganHayden Morgan
12
$endgroup$
1
$begingroup$
So the automaton should accept all words which end on 0 but not on 00.
$endgroup$
– Wuestenfux
Feb 2 at 12:14
$begingroup$
Your ternary representations allow leading zeroes. Maybe check tio find out whether this is really allowed. In your automaton you can merge $q_1$ and $q_2$. Further, it accepts the empty word. Again it is not clear whether this is a valid ternary number.
$endgroup$
– Peter Leupold
Feb 3 at 7:27
add a comment |
$begingroup$
L = {w ∈ {0,1,2} *: w is a ternary representation of an integer that is a multiple of 3 but not a multiple of 9}
I've written a DFA accepting multiples of 3, but I'm not sure how I should proceed. Any help would be very much appreciated, thank you.
computer-science automata
edited Feb 2 at 3:35
YuiTo Cheng
2,4064937
asked Feb 2 at 2:26
Hayden MorganHayden Morgan
12
$endgroup$
L = {w ∈ {0,1,2} *: w is a ternary representation of an integer that is a multiple of 3 but not a multiple of 9}
I've written a DFA accepting multiples of 3, but I'm not sure how I should proceed. Any help would be very much appreciated, thank you.
computer-science automata
computer-science automata
edited Feb 2 at 3:35
YuiTo Cheng
2,4064937
asked Feb 2 at 2:26
Hayden MorganHayden Morgan
12
edited Feb 2 at 3:35
YuiTo Cheng
2,4064937
asked Feb 2 at 2:26
Hayden MorganHayden Morgan
12
edited Feb 2 at 3:35
YuiTo Cheng
2,4064937
edited Feb 2 at 3:35
YuiTo Cheng
2,4064937
edited Feb 2 at 3:35
YuiTo Cheng
2,4064937
2,4064937
asked Feb 2 at 2:26
Hayden MorganHayden Morgan
12
asked Feb 2 at 2:26
Hayden MorganHayden Morgan
12
asked Feb 2 at 2:26
Hayden MorganHayden Morgan
12
12
1
$begingroup$
So the automaton should accept all words which end on 0 but not on 00.
$endgroup$
– Wuestenfux
Feb 2 at 12:14
$begingroup$
Your ternary representations allow leading zeroes. Maybe check tio find out whether this is really allowed. In your automaton you can merge $q_1$ and $q_2$. Further, it accepts the empty word. Again it is not clear whether this is a valid ternary number.
$endgroup$
– Peter Leupold
Feb 3 at 7:27
add a comment |
1
$begingroup$
So the automaton should accept all words which end on 0 but not on 00.
$endgroup$
– Wuestenfux
Feb 2 at 12:14
$begingroup$
Your ternary representations allow leading zeroes. Maybe check tio find out whether this is really allowed. In your automaton you can merge $q_1$ and $q_2$. Further, it accepts the empty word. Again it is not clear whether this is a valid ternary number.
$endgroup$
– Peter Leupold
Feb 3 at 7:27
1
1
$begingroup$
So the automaton should accept all words which end on 0 but not on 00.
$endgroup$
– Wuestenfux
Feb 2 at 12:14
$begingroup$
So the automaton should accept all words which end on 0 but not on 00.
$endgroup$
– Wuestenfux
Feb 2 at 12:14
$begingroup$
Your ternary representations allow leading zeroes. Maybe check tio find out whether this is really allowed. In your automaton you can merge $q_1$ and $q_2$. Further, it accepts the empty word. Again it is not clear whether this is a valid ternary number.
$endgroup$
– Peter Leupold
Feb 3 at 7:27
$begingroup$
Your ternary representations allow leading zeroes. Maybe check tio find out whether this is really allowed. In your automaton you can merge $q_1$ and $q_2$. Further, it accepts the empty word. Again it is not clear whether this is a valid ternary number.
$endgroup$
– Peter Leupold
Feb 3 at 7:27
add a comment |
1 Answer
1
active
oldest
votes
$begingroup$
Since you are asking for a NFA, and taking into account the comments by Wuestenfux and Peter Leupold, three states should suffice:
Note that there are three initial states in this automaton.
answered Feb 7 at 11:11
J.-E. PinJ.-E. Pin
18.6k21754
$endgroup$
add a comment |
Your Answer
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%2f3096969%2fgive-a-state-diagram-for-an-nfa-whose-language-l%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
$begingroup$
Since you are asking for a NFA, and taking into account the comments by Wuestenfux and Peter Leupold, three states should suffice:
Note that there are three initial states in this automaton.
answered Feb 7 at 11:11
J.-E. PinJ.-E. Pin
18.6k21754
$endgroup$
add a comment |
$begingroup$
Since you are asking for a NFA, and taking into account the comments by Wuestenfux and Peter Leupold, three states should suffice:
Note that there are three initial states in this automaton.
answered Feb 7 at 11:11
J.-E. PinJ.-E. Pin
18.6k21754
$endgroup$
add a comment |
$begingroup$
Since you are asking for a NFA, and taking into account the comments by Wuestenfux and Peter Leupold, three states should suffice:
Note that there are three initial states in this automaton.
answered Feb 7 at 11:11
J.-E. PinJ.-E. Pin
18.6k21754
$endgroup$
Since you are asking for a NFA, and taking into account the comments by Wuestenfux and Peter Leupold, three states should suffice:
Note that there are three initial states in this automaton.
answered Feb 7 at 11:11
J.-E. PinJ.-E. Pin
18.6k21754
answered Feb 7 at 11:11
J.-E. PinJ.-E. Pin
18.6k21754
answered Feb 7 at 11:11
J.-E. PinJ.-E. Pin
18.6k21754
answered Feb 7 at 11:11
J.-E. PinJ.-E. Pin
18.6k21754
18.6k21754
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.
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%2f3096969%2fgive-a-state-diagram-for-an-nfa-whose-language-l%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
1
$begingroup$
So the automaton should accept all words which end on 0 but not on 00.
$endgroup$
– Wuestenfux
Feb 2 at 12:14
$begingroup$
Your ternary representations allow leading zeroes. Maybe check tio find out whether this is really allowed. In your automaton you can merge $q_1$ and $q_2$. Further, it accepts the empty word. Again it is not clear whether this is a valid ternary number.
$endgroup$
– Peter Leupold
Feb 3 at 7:27