Some Binary Output Sequence Properties of Deterministic Autonomous Finite-State Machines with Probabilistic Initialization

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.