DocumentCode
1337491
Title
Cascaded Finite-State Machines
Author
Gill, Arthur
Author_Institution
Dept. of Elec. Engrg., University of California, Berkeley, Calif.
Issue
3
fYear
1961
Firstpage
366
Lastpage
370
Abstract
In this paper, networks of finite-state machines, rather than individual machines, are discussed. The investigation centers around cascade networks, where the output of one machine serves as an input to another. It is shown how, by means of connection matrices, the characteristics of such a network can be obtained from those of the component machines, and how a specified machine can be decomposed into a number of cascaded components. The advantages of such a decomposition, as well as some of the problems that remain to be solved in this area, are discussed.
Keywords
Automata; Circuit synthesis; Computer networks; Contracts; Integrated circuit interconnections; Matrix decomposition; Sequential circuits; Switching circuits; Transducers; Yttrium;
fLanguage
English
Journal_Title
Electronic Computers, IRE Transactions on
Publisher
ieee
ISSN
0367-9950
Type
jour
DOI
10.1109/TEC.1961.5219223
Filename
5219223
Link To Document