Input/Output Problem #1
$begingroup$
The basis for this problem is that you did to make an optimal pattern so that all inputted sequences will be "accepted" if they fit the rules of the problem and "rejected" if they break any of them.
.
Above are some examples of functions that can be performed. (A) shows a machine that will only accept the sequences that repeat 12 as you must begin at start and end on a red dot.
In (B) the "*" means you can pass along that route without an input there. So (B) accepts 1111122222, 22222, 1122 etc but doesn't accept any sequence in which there is a 1 after the 2.
In (C) you can move along either route to reach an end. So 12222 and 1333 are both accepted sequences.
All routes have to be either single digit or single letter. Obviously shorthand like "odd", "even" can be used in answers rather than drawing loads of arrows.
Problem #1
Make an optimal machine using digits 0-9 that only accepts sequences where the digits sum are even and rejects if they are odd.
mathematics
asked Nov 14 '18 at 10:58
Ben FranksBen Franks
50214
$endgroup$
add a comment |
$begingroup$
The basis for this problem is that you did to make an optimal pattern so that all inputted sequences will be "accepted" if they fit the rules of the problem and "rejected" if they break any of them.
.
Above are some examples of functions that can be performed. (A) shows a machine that will only accept the sequences that repeat 12 as you must begin at start and end on a red dot.
In (B) the "*" means you can pass along that route without an input there. So (B) accepts 1111122222, 22222, 1122 etc but doesn't accept any sequence in which there is a 1 after the 2.
In (C) you can move along either route to reach an end. So 12222 and 1333 are both accepted sequences.
All routes have to be either single digit or single letter. Obviously shorthand like "odd", "even" can be used in answers rather than drawing loads of arrows.
Problem #1
Make an optimal machine using digits 0-9 that only accepts sequences where the digits sum are even and rejects if they are odd.
mathematics
asked Nov 14 '18 at 10:58
Ben FranksBen Franks
50214
$endgroup$
7
$begingroup$
These things are called Finite State Machines, and requiring the simplest FSM makes a great puzzle, so I guess this puzzle type is one of the rare cases that would be on topic both here and on PCG. Nicely done!
$endgroup$
– Bass
Nov 14 '18 at 11:38
add a comment |
$begingroup$
The basis for this problem is that you did to make an optimal pattern so that all inputted sequences will be "accepted" if they fit the rules of the problem and "rejected" if they break any of them.
.
Above are some examples of functions that can be performed. (A) shows a machine that will only accept the sequences that repeat 12 as you must begin at start and end on a red dot.
In (B) the "*" means you can pass along that route without an input there. So (B) accepts 1111122222, 22222, 1122 etc but doesn't accept any sequence in which there is a 1 after the 2.
In (C) you can move along either route to reach an end. So 12222 and 1333 are both accepted sequences.
All routes have to be either single digit or single letter. Obviously shorthand like "odd", "even" can be used in answers rather than drawing loads of arrows.
Problem #1
Make an optimal machine using digits 0-9 that only accepts sequences where the digits sum are even and rejects if they are odd.
mathematics
asked Nov 14 '18 at 10:58
Ben FranksBen Franks
50214
$endgroup$
The basis for this problem is that you did to make an optimal pattern so that all inputted sequences will be "accepted" if they fit the rules of the problem and "rejected" if they break any of them.
.
Above are some examples of functions that can be performed. (A) shows a machine that will only accept the sequences that repeat 12 as you must begin at start and end on a red dot.
In (B) the "*" means you can pass along that route without an input there. So (B) accepts 1111122222, 22222, 1122 etc but doesn't accept any sequence in which there is a 1 after the 2.
In (C) you can move along either route to reach an end. So 12222 and 1333 are both accepted sequences.
All routes have to be either single digit or single letter. Obviously shorthand like "odd", "even" can be used in answers rather than drawing loads of arrows.
Problem #1
Make an optimal machine using digits 0-9 that only accepts sequences where the digits sum are even and rejects if they are odd.
mathematics
mathematics
asked Nov 14 '18 at 10:58
Ben FranksBen Franks
50214
asked Nov 14 '18 at 10:58
Ben FranksBen Franks
50214
edited Nov 14 '18 at 11:58
Ben Franks
asked Nov 14 '18 at 10:58
Ben FranksBen Franks
50214
asked Nov 14 '18 at 10:58
Ben FranksBen Franks
50214
asked Nov 14 '18 at 10:58
Ben FranksBen Franks
50214
50214
7
$begingroup$
These things are called Finite State Machines, and requiring the simplest FSM makes a great puzzle, so I guess this puzzle type is one of the rare cases that would be on topic both here and on PCG. Nicely done!
$endgroup$
– Bass
Nov 14 '18 at 11:38
add a comment |
7
$begingroup$
These things are called Finite State Machines, and requiring the simplest FSM makes a great puzzle, so I guess this puzzle type is one of the rare cases that would be on topic both here and on PCG. Nicely done!
$endgroup$
– Bass
Nov 14 '18 at 11:38
7
7
$begingroup$
These things are called Finite State Machines, and requiring the simplest FSM makes a great puzzle, so I guess this puzzle type is one of the rare cases that would be on topic both here and on PCG. Nicely done!
$endgroup$
– Bass
Nov 14 '18 at 11:38
$begingroup$
These things are called Finite State Machines, and requiring the simplest FSM makes a great puzzle, so I guess this puzzle type is one of the rare cases that would be on topic both here and on PCG. Nicely done!
$endgroup$
– Bass
Nov 14 '18 at 11:38
add a comment |
3 Answers
3
active
oldest
votes
$begingroup$
Would this work?
Left part is "odd", right part is "even".
answered Nov 14 '18 at 11:17
jafejafe
18.6k352181
$endgroup$
$begingroup$
Correct well done, stay tuned for some more (and harder) ones.
$endgroup$
– Ben Franks
Nov 14 '18 at 11:36
add a comment |
$begingroup$
This works:
Here odd means 1,3,5,7,9 / and even means 0,2,4,6,8
answered Nov 14 '18 at 11:18
u_ndefinedu_ndefined
2,638436
$endgroup$
$begingroup$
Correct solution +1. But jafe did answer first so I have given him the solution point.
$endgroup$
– Ben Franks
Nov 14 '18 at 11:35
add a comment |
$begingroup$
I believe this solution should work:
Where even means "even digit" and odd means "odd digit". Left node is START.
answered Nov 14 '18 at 11:16
NudgeNudgeNudgeNudge
1,846728
$endgroup$
$begingroup$
You can shrink this by one state.
$endgroup$
– Gareth McCaughan♦
Nov 14 '18 at 11:17
$begingroup$
I'm not sure you can, I'll give it a little thought. The other solutions have one fewer node but I'm not sure you can use the same node as start and end (because then an empty string would be a correct one?)
$endgroup$
– NudgeNudge
Nov 14 '18 at 11:18
$begingroup$
Solution works but can be optimised to use less points.
$endgroup$
– Ben Franks
Nov 14 '18 at 11:36
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: "559"
};
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: false,
noModals: true,
showLowRepImageUploadWarning: true,
reputationToPostImages: null,
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%2fpuzzling.stackexchange.com%2fquestions%2f75176%2finput-output-problem-1%23new-answer', 'question_page');
}
);
Post as a guest
Required, but never shown
3 Answers
3
active
oldest
votes
3 Answers
3
active
oldest
votes
active
oldest
votes
active
oldest
votes
$begingroup$
Would this work?
Left part is "odd", right part is "even".
answered Nov 14 '18 at 11:17
jafejafe
18.6k352181
$endgroup$
$begingroup$
Correct well done, stay tuned for some more (and harder) ones.
$endgroup$
– Ben Franks
Nov 14 '18 at 11:36
add a comment |
$begingroup$
Would this work?
Left part is "odd", right part is "even".
answered Nov 14 '18 at 11:17
jafejafe
18.6k352181
$endgroup$
$begingroup$
Correct well done, stay tuned for some more (and harder) ones.
$endgroup$
– Ben Franks
Nov 14 '18 at 11:36
add a comment |
$begingroup$
Would this work?
Left part is "odd", right part is "even".
answered Nov 14 '18 at 11:17
jafejafe
18.6k352181
$endgroup$
Would this work?
Left part is "odd", right part is "even".
answered Nov 14 '18 at 11:17
jafejafe
18.6k352181
answered Nov 14 '18 at 11:17
jafejafe
18.6k352181
answered Nov 14 '18 at 11:17
jafejafe
18.6k352181
answered Nov 14 '18 at 11:17
jafejafe
18.6k352181
18.6k352181
$begingroup$
Correct well done, stay tuned for some more (and harder) ones.
$endgroup$
– Ben Franks
Nov 14 '18 at 11:36
add a comment |
$begingroup$
Correct well done, stay tuned for some more (and harder) ones.
$endgroup$
– Ben Franks
Nov 14 '18 at 11:36
$begingroup$
Correct well done, stay tuned for some more (and harder) ones.
$endgroup$
– Ben Franks
Nov 14 '18 at 11:36
$begingroup$
Correct well done, stay tuned for some more (and harder) ones.
$endgroup$
– Ben Franks
Nov 14 '18 at 11:36
add a comment |
$begingroup$
This works:
Here odd means 1,3,5,7,9 / and even means 0,2,4,6,8
answered Nov 14 '18 at 11:18
u_ndefinedu_ndefined
2,638436
$endgroup$
$begingroup$
Correct solution +1. But jafe did answer first so I have given him the solution point.
$endgroup$
– Ben Franks
Nov 14 '18 at 11:35
add a comment |
$begingroup$
This works:
Here odd means 1,3,5,7,9 / and even means 0,2,4,6,8
answered Nov 14 '18 at 11:18
u_ndefinedu_ndefined
2,638436
$endgroup$
$begingroup$
Correct solution +1. But jafe did answer first so I have given him the solution point.
$endgroup$
– Ben Franks
Nov 14 '18 at 11:35
add a comment |
$begingroup$
This works:
Here odd means 1,3,5,7,9 / and even means 0,2,4,6,8
answered Nov 14 '18 at 11:18
u_ndefinedu_ndefined
2,638436
$endgroup$
This works:
Here odd means 1,3,5,7,9 / and even means 0,2,4,6,8
answered Nov 14 '18 at 11:18
u_ndefinedu_ndefined
2,638436
answered Nov 14 '18 at 11:18
u_ndefinedu_ndefined
2,638436
answered Nov 14 '18 at 11:18
u_ndefinedu_ndefined
2,638436
answered Nov 14 '18 at 11:18
u_ndefinedu_ndefined
2,638436
2,638436
$begingroup$
Correct solution +1. But jafe did answer first so I have given him the solution point.
$endgroup$
– Ben Franks
Nov 14 '18 at 11:35
add a comment |
$begingroup$
Correct solution +1. But jafe did answer first so I have given him the solution point.
$endgroup$
– Ben Franks
Nov 14 '18 at 11:35
$begingroup$
Correct solution +1. But jafe did answer first so I have given him the solution point.
$endgroup$
– Ben Franks
Nov 14 '18 at 11:35
$begingroup$
Correct solution +1. But jafe did answer first so I have given him the solution point.
$endgroup$
– Ben Franks
Nov 14 '18 at 11:35
add a comment |
$begingroup$
I believe this solution should work:
answered Nov 14 '18 at 11:16
NudgeNudgeNudgeNudge
1,846728
$endgroup$
$begingroup$
You can shrink this by one state.
$endgroup$
– Gareth McCaughan♦
Nov 14 '18 at 11:17
$begingroup$
I'm not sure you can, I'll give it a little thought. The other solutions have one fewer node but I'm not sure you can use the same node as start and end (because then an empty string would be a correct one?)
$endgroup$
– NudgeNudge
Nov 14 '18 at 11:18
$begingroup$
Solution works but can be optimised to use less points.
$endgroup$
– Ben Franks
Nov 14 '18 at 11:36
add a comment |
$begingroup$
I believe this solution should work:
answered Nov 14 '18 at 11:16
NudgeNudgeNudgeNudge
1,846728
$endgroup$
$begingroup$
You can shrink this by one state.
$endgroup$
– Gareth McCaughan♦
Nov 14 '18 at 11:17
$begingroup$
I'm not sure you can, I'll give it a little thought. The other solutions have one fewer node but I'm not sure you can use the same node as start and end (because then an empty string would be a correct one?)
$endgroup$
– NudgeNudge
Nov 14 '18 at 11:18
$begingroup$
Solution works but can be optimised to use less points.
$endgroup$
– Ben Franks
Nov 14 '18 at 11:36
add a comment |
$begingroup$
I believe this solution should work:
answered Nov 14 '18 at 11:16
NudgeNudgeNudgeNudge
1,846728
$endgroup$
I believe this solution should work:
answered Nov 14 '18 at 11:16
NudgeNudgeNudgeNudge
1,846728
edited Nov 14 '18 at 11:17
answered Nov 14 '18 at 11:16
NudgeNudgeNudgeNudge
1,846728
answered Nov 14 '18 at 11:16
NudgeNudgeNudgeNudge
1,846728
answered Nov 14 '18 at 11:16
NudgeNudgeNudgeNudge
1,846728
1,846728
$begingroup$
You can shrink this by one state.
$endgroup$
– Gareth McCaughan♦
Nov 14 '18 at 11:17
$begingroup$
I'm not sure you can, I'll give it a little thought. The other solutions have one fewer node but I'm not sure you can use the same node as start and end (because then an empty string would be a correct one?)
$endgroup$
– NudgeNudge
Nov 14 '18 at 11:18
$begingroup$
Solution works but can be optimised to use less points.
$endgroup$
– Ben Franks
Nov 14 '18 at 11:36
add a comment |
$begingroup$
You can shrink this by one state.
$endgroup$
– Gareth McCaughan♦
Nov 14 '18 at 11:17
$begingroup$
I'm not sure you can, I'll give it a little thought. The other solutions have one fewer node but I'm not sure you can use the same node as start and end (because then an empty string would be a correct one?)
$endgroup$
– NudgeNudge
Nov 14 '18 at 11:18
$begingroup$
Solution works but can be optimised to use less points.
$endgroup$
– Ben Franks
Nov 14 '18 at 11:36
$begingroup$
You can shrink this by one state.
$endgroup$
– Gareth McCaughan♦
Nov 14 '18 at 11:17
$begingroup$
You can shrink this by one state.
$endgroup$
– Gareth McCaughan♦
Nov 14 '18 at 11:17
$begingroup$
I'm not sure you can, I'll give it a little thought. The other solutions have one fewer node but I'm not sure you can use the same node as start and end (because then an empty string would be a correct one?)
$endgroup$
– NudgeNudge
Nov 14 '18 at 11:18
$begingroup$
I'm not sure you can, I'll give it a little thought. The other solutions have one fewer node but I'm not sure you can use the same node as start and end (because then an empty string would be a correct one?)
$endgroup$
– NudgeNudge
Nov 14 '18 at 11:18
$begingroup$
Solution works but can be optimised to use less points.
$endgroup$
– Ben Franks
Nov 14 '18 at 11:36
$begingroup$
Solution works but can be optimised to use less points.
$endgroup$
– Ben Franks
Nov 14 '18 at 11:36
add a comment |
Thanks for contributing an answer to Puzzling 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%2fpuzzling.stackexchange.com%2fquestions%2f75176%2finput-output-problem-1%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
7
$begingroup$
These things are called Finite State Machines, and requiring the simplest FSM makes a great puzzle, so I guess this puzzle type is one of the rare cases that would be on topic both here and on PCG. Nicely done!
$endgroup$
– Bass
Nov 14 '18 at 11:38