A Method for Minimizing Incompletely Specified Sequential Machines

DOI10.1109/TC.1980.1675655zbMath0438.68015OpenAlexW2030683615MaRDI QIDQ3880284

Masaru Yamamoto

Publication date: 1980

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

Full work available at URL: https://doi.org/10.1109/tc.1980.1675655

zbMATH Keywords

complement graphstate minimizationdirected tree graphincompletely specified sequential machines

Mathematics Subject Classification ID

Formal languages and automata (68Q45) Applications of graph theory to circuits and networks (94C15)

Related Items (1)

Minimal coverings for incompletely specified sequential machines

This page was built for publication: A Method for Minimizing Incompletely Specified Sequential Machines