Some Techniques of State Assignment for Synchronous Sequential Machines
- 1 October 1964
- journal article
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Electronic Computers
- Vol. EC-13 (5) , 507-518
- https://doi.org/10.1109/pgec.1964.263722
Abstract
This paper is an extension of the work of Hartmanis and Stearns on sequential machine state assignments with reduced dependence. In Section II the critical partition pairs of transition-incomplete sequential machines are defined, and methods are given for computing them. Section III pursues certain combinatorial problems associated with the construction of assignments with reduced dependence, once the critical partition pairs are known. The algorithms derived in this paper provide the nucleus of a systematic procedure for the construction of economical state assignments.Keywords
This publication has 3 references indexed in Scilit:
- Multiple Reduction of Variable Dependency of Sequential MachinesJournal of the ACM, 1962
- 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