On minimal covering of incompletely specified sequential networks

DOI10.1016/0016-0032(71)90199-2zbMath0254.94039OpenAlexW2092524402MaRDI QIDQ2558195

Tse-Yun Feng

Publication date: 1971

Published in: Journal of the Franklin Institute (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0016-0032(71)90199-2

Mathematics Subject Classification ID

Cites Work

• Unnamed Item
• Slave Memories and Dynamic Storage Allocation
• Extending the Definition of Prime Compatibility Classes of States in Incomplete Sequential Machine Reduction
• State Assignments in Combinational Networks
• Autonomous Clocks in Sequential Machines

This page was built for publication: On minimal covering of incompletely specified sequential networks