On the Minimization of the Number of Internal States in Incompletely Specified Sequential Machines
| dc.citation.epage | 188 | en_US |
| dc.citation.issue | 2 | en_US |
| dc.citation.spage | 173 | en_US |
| dc.citation.volume | 3 | en_US |
| dc.contributor.author | 楊超植 | zh_TW |
| dc.contributor.author | 馮慶深 | zh_TW |
| dc.contributor.author | C.C.Yang | en_US |
| dc.contributor.author | H.S.Fung | en_US |
| dc.date.accessioned | 2017-10-06T06:17:51Z | |
| dc.date.available | 2017-10-06T06:17:51Z | |
| dc.date.issued | 1969-04 | en_US |
| dc.description.abstract | The algorithm of a systematic minimization method givrn in this paper uses tree idea for generating all compatibility classes and uses Meisel's tree display to produce all possible minimal solutions of a given incompletely specified sequential machine. An example is given for illustration. | en_US |
| dc.identifier.journal | 交大學刊 | zh_TW |
| dc.identifier.journal | SCIENCE BULLETIN NATIONAL CHIAO-TUNG UNIVERSITY | en_US |
| dc.identifier.uri | https://ir.lib.nycu.edu.tw/handle/11536/137454 | |
| dc.language.iso | en_US | en_US |
| dc.publisher | 交大學刊編輯委員會 | zh_TW |
| dc.title | On the Minimization of the Number of Internal States in Incompletely Specified Sequential Machines | en_US |
| dc.type | Campus Publications | en_US |