Answers are grounded in this paper and cite their sources.
Discrete sequential systems, such as sampled data systems, discrete Markov processes, linear shift register generators, computer programs, sequential code generators, and prefixed comma-free codes, can be represented and studied in a uniform manner by directed graphs and their generating functions. In this paper the properties of the generating functions are examined from certain connectivity considerations of these graphs.
No takes yet. Share an insight, caveat, or question.
C. V. Ramamoorthy (1966) studied this question.
Synapse has enriched 10 related papers. Consider them for comparative context: