Input/Output Problem #1











up vote
12
down vote

favorite












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







share|improve this question









New contributor




Ben Franks is a new contributor to this site. Take care in asking for clarification, commenting, and answering.
Check out our Code of Conduct.
















  • 7




    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!
    – Bass
    Nov 14 at 11:38















up vote
12
down vote

favorite












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







share|improve this question









New contributor




Ben Franks is a new contributor to this site. Take care in asking for clarification, commenting, and answering.
Check out our Code of Conduct.
















  • 7




    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!
    – Bass
    Nov 14 at 11:38













up vote
12
down vote

favorite









up vote
12
down vote

favorite











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







share|improve this question









New contributor




Ben Franks is a new contributor to this site. Take care in asking for clarification, commenting, and answering.
Check out our Code of Conduct.











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






share|improve this question









New contributor




Ben Franks is a new contributor to this site. Take care in asking for clarification, commenting, and answering.
Check out our Code of Conduct.











share|improve this question









New contributor




Ben Franks is a new contributor to this site. Take care in asking for clarification, commenting, and answering.
Check out our Code of Conduct.









share|improve this question




share|improve this question








edited Nov 14 at 11:58





















New contributor




Ben Franks is a new contributor to this site. Take care in asking for clarification, commenting, and answering.
Check out our Code of Conduct.









asked Nov 14 at 10:58









Ben Franks

30212




30212




New contributor




Ben Franks is a new contributor to this site. Take care in asking for clarification, commenting, and answering.
Check out our Code of Conduct.





New contributor





Ben Franks is a new contributor to this site. Take care in asking for clarification, commenting, and answering.
Check out our Code of Conduct.






Ben Franks is a new contributor to this site. Take care in asking for clarification, commenting, and answering.
Check out our Code of Conduct.








  • 7




    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!
    – Bass
    Nov 14 at 11:38














  • 7




    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!
    – Bass
    Nov 14 at 11:38








7




7




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!
– Bass
Nov 14 at 11:38




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!
– Bass
Nov 14 at 11:38










3 Answers
3






active

oldest

votes

















up vote
9
down vote



accepted










Would this work?




Left part is "odd", right part is "even".

enter image description here







share|improve this answer





















  • Correct well done, stay tuned for some more (and harder) ones.
    – Ben Franks
    Nov 14 at 11:36


















up vote
6
down vote













This works:




enter image description here

Here odd means 1,3,5,7,9 / and even means 0,2,4,6,8







share|improve this answer





















  • Correct solution +1. But jafe did answer first so I have given him the solution point.
    – Ben Franks
    Nov 14 at 11:35


















up vote
5
down vote













I believe this solution should work:




enter image description here Where even means "even digit" and odd means "odd digit". Left node is START.







share|improve this answer























  • You can shrink this by one state.
    – Gareth McCaughan♦
    Nov 14 at 11:17










  • 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?)
    – NudgeNudge
    Nov 14 at 11:18












  • Solution works but can be optimised to use less points.
    – Ben Franks
    Nov 14 at 11:36











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',
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
});


}
});






Ben Franks is a new contributor. Be nice, and check out our Code of Conduct.










 

draft saved


draft discarded


















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








up vote
9
down vote



accepted










Would this work?




Left part is "odd", right part is "even".

enter image description here







share|improve this answer





















  • Correct well done, stay tuned for some more (and harder) ones.
    – Ben Franks
    Nov 14 at 11:36















up vote
9
down vote



accepted










Would this work?




Left part is "odd", right part is "even".

enter image description here







share|improve this answer





















  • Correct well done, stay tuned for some more (and harder) ones.
    – Ben Franks
    Nov 14 at 11:36













up vote
9
down vote



accepted







up vote
9
down vote



accepted






Would this work?




Left part is "odd", right part is "even".

enter image description here







share|improve this answer












Would this work?




Left part is "odd", right part is "even".

enter image description here








share|improve this answer












share|improve this answer



share|improve this answer










answered Nov 14 at 11:17









jafe

12.8k29133




12.8k29133












  • Correct well done, stay tuned for some more (and harder) ones.
    – Ben Franks
    Nov 14 at 11:36


















  • Correct well done, stay tuned for some more (and harder) ones.
    – Ben Franks
    Nov 14 at 11:36
















Correct well done, stay tuned for some more (and harder) ones.
– Ben Franks
Nov 14 at 11:36




Correct well done, stay tuned for some more (and harder) ones.
– Ben Franks
Nov 14 at 11:36










up vote
6
down vote













This works:




enter image description here

Here odd means 1,3,5,7,9 / and even means 0,2,4,6,8







share|improve this answer





















  • Correct solution +1. But jafe did answer first so I have given him the solution point.
    – Ben Franks
    Nov 14 at 11:35















up vote
6
down vote













This works:




enter image description here

Here odd means 1,3,5,7,9 / and even means 0,2,4,6,8







share|improve this answer





















  • Correct solution +1. But jafe did answer first so I have given him the solution point.
    – Ben Franks
    Nov 14 at 11:35













up vote
6
down vote










up vote
6
down vote









This works:




enter image description here

Here odd means 1,3,5,7,9 / and even means 0,2,4,6,8







share|improve this answer












This works:




enter image description here

Here odd means 1,3,5,7,9 / and even means 0,2,4,6,8








share|improve this answer












share|improve this answer



share|improve this answer










answered Nov 14 at 11:18









u_ndefined

2,593436




2,593436












  • Correct solution +1. But jafe did answer first so I have given him the solution point.
    – Ben Franks
    Nov 14 at 11:35


















  • Correct solution +1. But jafe did answer first so I have given him the solution point.
    – Ben Franks
    Nov 14 at 11:35
















Correct solution +1. But jafe did answer first so I have given him the solution point.
– Ben Franks
Nov 14 at 11:35




Correct solution +1. But jafe did answer first so I have given him the solution point.
– Ben Franks
Nov 14 at 11:35










up vote
5
down vote













I believe this solution should work:




enter image description here Where even means "even digit" and odd means "odd digit". Left node is START.







share|improve this answer























  • You can shrink this by one state.
    – Gareth McCaughan♦
    Nov 14 at 11:17










  • 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?)
    – NudgeNudge
    Nov 14 at 11:18












  • Solution works but can be optimised to use less points.
    – Ben Franks
    Nov 14 at 11:36















up vote
5
down vote













I believe this solution should work:




enter image description here Where even means "even digit" and odd means "odd digit". Left node is START.







share|improve this answer























  • You can shrink this by one state.
    – Gareth McCaughan♦
    Nov 14 at 11:17










  • 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?)
    – NudgeNudge
    Nov 14 at 11:18












  • Solution works but can be optimised to use less points.
    – Ben Franks
    Nov 14 at 11:36













up vote
5
down vote










up vote
5
down vote









I believe this solution should work:




enter image description here Where even means "even digit" and odd means "odd digit". Left node is START.







share|improve this answer














I believe this solution should work:




enter image description here Where even means "even digit" and odd means "odd digit". Left node is START.








share|improve this answer














share|improve this answer



share|improve this answer








edited Nov 14 at 11:17

























answered Nov 14 at 11:16









NudgeNudge

1,069621




1,069621












  • You can shrink this by one state.
    – Gareth McCaughan♦
    Nov 14 at 11:17










  • 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?)
    – NudgeNudge
    Nov 14 at 11:18












  • Solution works but can be optimised to use less points.
    – Ben Franks
    Nov 14 at 11:36


















  • You can shrink this by one state.
    – Gareth McCaughan♦
    Nov 14 at 11:17










  • 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?)
    – NudgeNudge
    Nov 14 at 11:18












  • Solution works but can be optimised to use less points.
    – Ben Franks
    Nov 14 at 11:36
















You can shrink this by one state.
– Gareth McCaughan♦
Nov 14 at 11:17




You can shrink this by one state.
– Gareth McCaughan♦
Nov 14 at 11:17












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?)
– NudgeNudge
Nov 14 at 11:18






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?)
– NudgeNudge
Nov 14 at 11:18














Solution works but can be optimised to use less points.
– Ben Franks
Nov 14 at 11:36




Solution works but can be optimised to use less points.
– Ben Franks
Nov 14 at 11:36










Ben Franks is a new contributor. Be nice, and check out our Code of Conduct.










 

draft saved


draft discarded


















Ben Franks is a new contributor. Be nice, and check out our Code of Conduct.













Ben Franks is a new contributor. Be nice, and check out our Code of Conduct.












Ben Franks is a new contributor. Be nice, and check out our Code of Conduct.















 


draft saved


draft discarded














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





















































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







-

Popular posts from this blog

Probability when a professor distributes a quiz and homework assignment to a class of n students.

Image
0 0 $begingroup$ Need help with this problem. Suppose our lazy professor collects a quiz and a homework assignment from a class of n students one day, then distributes both the quizzes and the homework assignments back to the class in a random fashion for grading. Each student receives one quiz and one homework assignment to grade. (a) What is the probability that every student receives someone else's quiz to grade, and someone else's homework to grade? (b) What is the probability that no student receives both their own quiz and their own homework assignment to grade? In this case, some students may receive their own quiz, and others may receive their own homework assignment. (c) Compute the limiting probability as n approaches infinity in each case. ...
Read more

Aardman Animations

Image
Aardman Animations, Ltd. Aardman Animations Tipo privada Atividade Animação em stop-motion , Animação em CGI Fundação 1972 Fundador(es) Peter Lord David Sproxton Sede Bristol, Inglaterra  Reino Unido Proprietário(s) Dreamworks Pessoas-chave Peter Lord David Sproxton Nick Park Divisões Aardman Features Aardman Digital Aardman Commercials Aardman Broadcast Aardman International Aardman Rights Aardman Effects Aardman 3-D Systems Aardman Nathan Love AardBoiled Website oficial aardman.com ...
Read more

Are they similar matrix

Image
0 $begingroup$ Do $begin{bmatrix} 0&i&0\0&0&1\0&0&0 end{bmatrix} $ and $begin{bmatrix} 0&0&0\-i&0&0\0&1&0 end{bmatrix} $ are similar.Is this True/false Clearly both are nilpotent and one is conjucate transpose of other but how to know if they are similar.i'm stuck. Please help me linear-algebra vector-spaces eigenvalues-eigenvectors generalizedeigenvector share | cite | improve this question edited Dec 10 '18 at 6:38 Vasanth Kris asked Dec 10 '18 at 6:19 ...
Read more