OntheEfficient Assignment ofInternal Codes toSequential Machines

.' oftheinputs. Attention isfocused onaparticular subset oftheseplexity. Thetechnique hasbeenapplied toseveral small mappings, called prmappings. Anumerical score isassigned toeach(<16state) handworked examples andhasyielded asprmapping, which isameasure ofthedesirability of"selecting" thesignments whicharebelieved tobenearly optimum. mapping forinclusion ina"basic set" ofmappings. Abasic sethas However, theutility ofanassignmiient process for theproperty ofdetermining a unique codeassignment (within a problems which aretoolarge tobeworkedbyhand, desymmetry ofthecubeofinternal states). Theprocedures areapplied toa3-stage shift register andresultpendslargely onwhether itcanbeimplemented bya intheoptimum encoding forthat device. Finally, itisbriefly indi-computer program whoseexecution timeisnotexorbicated howthreeprevious assignment methods, including onede- tant. Algorithmsfor implemiienting thevarious procedures veloped bytheauthor, arerelated tothose described here. havenotbeenfullv developed, andfurther workmay Algorithms arepresented forsomebutnotalloftheproposedindicate thatsome ofthesealgorithms result inunreaprocedures. Thesealgorithms mustbecompleted before thepro-sonably longprograms. To alleviate thissituation, it posals canbeimplemented byacomputer program. I