State Assignments in Combinational Networks
From MaRDI portal
Publication:5596841
DOI10.1109/PGEC.1965.264139zbMath0199.04606OpenAlexW2110447914MaRDI QIDQ5596841
No author found.
Publication date: 1965
Published in: IEEE Transactions on Electronic Computers (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1109/pgec.1965.264139
Related Items (7)
Minimal solutions of Paull-Unger problems ⋮ Minimal coverings for incompletely specified sequential machines ⋮ A generalization of the theory of incompletely specified machines ⋮ Unnamed Item ⋮ A note on the derivation of maximal compatibility classes ⋮ Method for state reduction of automata taking into account technical peculiarities of synchronous and asynchronous operational modes ⋮ On minimal covering of incompletely specified sequential networks
This page was built for publication: State Assignments in Combinational Networks
