Two Tests for the Linearity of Sequential Machines
- 1 December 1965
- journal article
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Electronic Computers
- Vol. EC-14 (6) , 781-786
- https://doi.org/10.1109/PGEC.1965.264048
Abstract
This paper describes two tests for the existence of a linear state assignment for binary input sequential machines. The first test is based on ``transfer sequences'' which map one stationary state of a machine onto another stationary state. It is shown that from a minimal transfer sequence of a machine one can read off directly a linear assignment of this machine if one exists. The second test uses ``ignorance'' computations by means of partitions and previously developed results about sequential machine structure.Keywords
This publication has 4 references indexed in Scilit:
- Pair algebra and its application to automata theoryInformation and Control, 1964
- On the Linearity of Autonomous Sequential MachinesIEEE Transactions on Electronic Computers, 1964
- A Study of Feedback and Errors in Sequential MachinesIEEE Transactions on Electronic Computers, 1963
- State diagram of linear sequential machinesJournal of the Franklin Institute, 1962