Maximal Autonomous Clocks of Sequential Machines
- 1 February 1962
- journal article
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Electronic Computers
- Vol. EC-11 (1) , 83-86
- https://doi.org/10.1109/tec.1962.5219325
Abstract
Some sequential machinies contain input-independent parts and can therefore be input-inependent machine (an autonomous clock) and an input-dependent machine. Necessary and sufficient conditions on the flow table are obtained for the existence of autonomous clocks in sequential machines, and the properties of these machines and their clocks are studied.Keywords
This publication has 3 references indexed in Scilit:
- On the State Assignment Problem for Sequential Machines IIIEEE Transactions on Electronic Computers, 1961
- On the State Assignment Problem for Sequential Machines. IIEEE Transactions on Electronic Computers, 1961
- Symbolic analysis of a decomposition of information processing machinesInformation and Control, 1960