State Assignments in Combinational Networks

DOI10.1109/PGEC.1965.264139MaRDI QIDQ5596841zbMATH OpenOpenAlexFDO

Authors

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

zbMATH Keywords

languages, automata, networks

Mathematics Subject Classification ID

Formal languages and automata (68Q45)

Cited in

(7)

• Minimal coverings for incompletely specified sequential machines
• A generalization of the theory of incompletely specified machines
• 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
• scientific article; zbMATH DE number 3266249 (Why is no real title available?)
• Minimal solutions of Paull-Unger problems

This page was built for publication: State Assignments in Combinational Networks

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5596841)