Some Techniques of State Assignment for Synchronous Sequential Machines
From MaRDI portal
Publication:5335653
Recommendations
Cited in
(16)- Clock conversion in sequential machines and the synthesis of relay networks
- Sequential Machines, Ambiguity, and Dynamic Programming
- Some dangers in state reduction of sequential machines
- scientific article; zbMATH DE number 3907778 (Why is no real title available?)
- scientific article; zbMATH DE number 3968504 (Why is no real title available?)
- Realization with Feedback Encoding. II: Applications to Distinguishing Sequences
- The L‐map method for sequential machine state minimization
- scientific article; zbMATH DE number 647673 (Why is no real title available?)
- scientific article; zbMATH DE number 1174493 (Why is no real title available?)
- scientific article; zbMATH DE number 1751911 (Why is no real title available?)
- scientific article; zbMATH DE number 3999305 (Why is no real title available?)
- scientific article; zbMATH DE number 3240067 (Why is no real title available?)
- Sequential Machines Realizable with Delay Elements Only
- scientific article; zbMATH DE number 3310917 (Why is no real title available?)
- scientific article; zbMATH DE number 3414211 (Why is no real title available?)
- Transition submatrices in regular homing experiments and identification of sequential machines of known class using direct-sum transition matrices
This page was built for publication: Some Techniques of State Assignment for Synchronous Sequential Machines
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5335653)