On Coding the States of Sequential Machines with the Use of Partition Pairs

Torben U. Zahle

Research output: Contribution to journalJournal articleResearchpeer-review

301 Downloads (Pure)

Abstract

This article introduces a new technique of making state assignment for sequential machines. The technique is in line with the approach used by Hartmanis [l], Stearns and Hartmanis [3], and Curtis [4]. It parallels the work of Dolotta and McCluskey [7], although it was developed independently. The paper describes a procedure for making assignments based on partition pairs with successive choice of the partition
Original languageEnglish
JournalI E E E Transactions on Computers
VolumeEC-15
Issue number2
Pages (from-to)249-253
ISSN0018-9340
DOIs
Publication statusPublished - 1966

Bibliographical note

Copyright: 1966 IEEE. Personal use of this material is permitted. However, permission to reprint/republish this material for advertising or promotional purposes or for creating new collective works for resale or redistribution to servers or lists, or to reuse any copyrighted component of this work in other works must be obtained from the IEEE

Fingerprint Dive into the research topics of 'On Coding the States of Sequential Machines with the Use of Partition Pairs'. Together they form a unique fingerprint.

Cite this