Title :
Some Binary Output Sequence Properties of Deterministic Autonomous Finite-State Machines with Probabilistic Initialization
Author_Institution :
Advanced Automation Technology Department, IBM Corporation, Owego, N.Y. 13827.
Abstract :
An improved bound on the number of low-weight sequences that may be generated by L-step observable autonomous finite-state machines is derived. An upper and lower bound on the range of L for this same class of machines is also developed.
Keywords :
Automata; Electrons; Entropy; Feedback circuits; Information theory; Logic; Pediatrics; Roentgenium; Switching circuits; Upper bound; Autonomous machines; control logic; finite automata; sequence generators; shift register sequences;
Journal_Title :
Computers, IEEE Transactions on
DOI :
10.1109/TC.1973.5009185
