See here for basic rules on problem.
Problem #4
Make an optimal machine that accepts sequences of digits 1-3 that contain a 1,2,3 in each triple of numbers and has no repeating number. E.g accepts 123123, 132321 but rejects 121323, 123321.
See here for basic rules on problem.
Problem #4
Make an optimal machine that accepts sequences of digits 1-3 that contain a 1,2,3 in each triple of numbers and has no repeating number. E.g accepts 123123, 132321 but rejects 121323, 123321.
It seems that the solutions being considered optimal are the ones with the fewest numbers of nodes.
Solution using only 8 nodes below (Thrown together quickly on paint, sorry):
121323
rejected? $\endgroup$ – eye_am_groot Nov 14 '18 at 11:57