NDLI: Minimization of Incompletely Specified Sequential Machines

Content Provider	IEEE Xplore Digital Library
Author	Rao, C.V.S. Biswas, N.N.
Copyright Year	1968
Abstract	A simple yet efficient method for the minimization of incompletely specified sequential machines (ISSM's) is proposed. Precise theorems are developed, as a consequence of which several compatibles can be deleted from consideration at the very first stage in the search for a minimal closed cover. Thus, the computational work is significantly reduced. Initial cardinality of the minimal closed cover is further reduced by a consideration of the maximal compatibles (MC's) only; as a result the method converges to the solution faster than the existing procedures. "Rank" of a compatible is defined. It is shown that ordering the compatibles, in accordance with their rank, reduces the number of comparisons to be made in the search for exclusion of compatibles. The new method is simple, systematic, and programmable. It does not involve any heuristics or intuitive procedures. For small- and medium-sized machines, it can be used for hand computation as well. For one of the illustrative examples used in this paper, 30 out of 40 compatibles can be ignored in accordance with the proposed rules and the remaining 10 compatibles only need be considered for obtaining a minimal solution.
Sponsorship	IEEE Computer Society Technical Committee on Distributed Process IEEE Computer Society Technical Committee on VLSI IEEE Technical Committee on Computer Architecture IEEE Computer Society
Starting Page	1089
Ending Page	1100
Page Count	12
File Size	3701482
File Format	PDF
ISSN	00189340
Volume Number	C-24
Issue Number	11
Language	English
Publisher	Institute of Electrical and Electronics Engineers, Inc. (IEEE)
Publisher Date	1975-11-01
Publisher Place	U.S.A.
Access Restriction	One Nation One Subscription (ONOS)
Rights Holder	Institute of Electrical and Electronics Engineers, Inc. (IEEE)
Subject Keyword	Basic compatible, deletion of compatibles, exclusion of compatibles, incompletely specified sequential machine, minimal closed cover, min-max cover, primary compatible, prime closed sets of compatibles, rank of a compatible, symbolic compatible.
Content Type	Text
Resource Type	Article
Subject	Theoretical Computer Science Computational Theory and Mathematics Software Hardware and Architecture

Sl.	Authority	Responsibilities	Communication Details
1	Ministry of Education (GoI), Department of Higher Education	Sanctioning Authority	https://www.education.gov.in/ict-initiatives
2	Indian Institute of Technology Kharagpur	Host Institute of the Project: The host institute of the project is responsible for providing infrastructure support and hosting the project	https://www.iitkgp.ac.in
3	National Digital Library of India Office, Indian Institute of Technology Kharagpur	The administrative and infrastructural headquarters of the project	Dr. B. Sutradhar bsutra@ndl.gov.in
4	Project PI / Joint PI	Principal Investigator and Joint Principal Investigators of the project	Dr. B. Sutradhar bsutra@ndl.gov.in Prof. Saswat Chakrabarti will be added soon
5	Website/Portal (Helpdesk)	Queries regarding NDLI and its services	support@ndl.gov.in
6	Contents and Copyright Issues	Queries related to content curation and copyright issues	content@ndl.gov.in
7	National Digital Library of India Club (NDLI Club)	Queries related to NDLI Club formation, support, user awareness program, seminar/symposium, collaboration, social media, promotion, and outreach	clubsupport@ndl.gov.in
8	Digital Preservation Centre (DPC)	Assistance with digitizing and archiving copyright-free printed books	dpc@ndl.gov.in
9	IDR Setup or Support	Queries related to establishment and support of Institutional Digital Repository (IDR) and IDR workshops	idr@ndl.gov.in

An Efficient State Minimization Algorithm for Some Special Classes of Incompletely Specified Sequential Machines

State Minimization of Incompletely Specified Sequential Machines

A Method for Minimizing Incompletely Specified Sequential Machines

State Minimization of Incompletely Specified Sequential Machines

A Note on State Minimization of a Special Class of Incomplete Sequential Machines

Further Comments on Closure Partition Method for Minimizing Incomplete Sequential Machines

State Reduction in Incompletely Specified Finite-State Machines

Fast State Minimization of Incompletely Specified Sequential Machines

An efficient algorithm to search for minimal closed covers in sequential machines (1993)

Minimization of Incompletely Specified Sequential Machines

Similar Documents

An Efficient State Minimization Algorithm for Some Special Classes of Incompletely Specified Sequential Machines

State Minimization of Incompletely Specified Sequential Machines

A Method for Minimizing Incompletely Specified Sequential Machines

State Minimization of Incompletely Specified Sequential Machines

A Note on State Minimization of a Special Class of Incomplete Sequential Machines

Further Comments on Closure Partition Method for Minimizing Incomplete Sequential Machines

State Reduction in Incompletely Specified Finite-State Machines

Fast State Minimization of Incompletely Specified Sequential Machines

An efficient algorithm to search for minimal closed covers in sequential machines (1993)

Minimization of Incompletely Specified Sequential Machines