Simplification of Incompletely Specified Flow Tables with the Help of Prime Closed Sets

DOI10.1109/T-C.1969.222552zbMath0183.45602OpenAlexW1993233904MaRDI QIDQ5575122

No author found.

Publication date: 1969

Published in: IEEE Transactions on Computers (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1109/t-c.1969.222552

zbMATH Keywords

computer science and automata

Related Items (2)

Minimal coverings for incompletely specified sequential machines ⋮ On shift register realization of sequential machines

This page was built for publication: Simplification of Incompletely Specified Flow Tables with the Help of Prime Closed Sets