Covering logical ciruits by modules of some commercially produced systems

DOI10.1007/BF01074779MaRDI QIDQ3767264zbMATH OpenFDO

Authors G. P. Agibalov, A. M. Oranov

Publication date 1986

Published in Cybernetics (Search for Journal in Brave)

zbMATH Keywords

free modulecovering algorithmM-covering

Mathematics Subject Classification ID

Cellular automata (computational aspects) (68Q80) Switching theory, applications of Boolean algebras to circuits and networks (94C11)

Recommendations

• Publication:3197772
• Publication:3035136
• Minimal cut cover of a graph with an application to the testing of electronic boards
• Minimal coverings for incompletely specified sequential machines
• scientific article; zbMATH DE number 3893101

Cited in

(2)

• Algorithms for constructing the shortest allowable partitions of finite sets
• scientific article; zbMATH DE number 4172917 (Why is no real title available?)

This page was built for publication: Covering logical ciruits by modules of some commercially produced systems

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