Covering logical ciruits by modules of some commercially produced systems

DOI10.1007/BF01074779zbMATH Open0629.94024MaRDI QIDQ3767264FDOQ3767264

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

Publication date: 1986

Published in: Cybernetics (Search for Journal in Brave)

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

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)

Cited In (2)

• Title not available (Why is that?)
• Algorithms for constructing the shortest allowable partitions of finite sets

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)