Minimal coverings for incompletely specified sequential machines

Related Items (2)

First-order spectra with one variable ⋮ Exact complexity of problems of incompletely specified automata

Cites Work

Partial abstract types
On the Reduction of Superfluous States in a Sequential Machine
Connective Properties Preserved in Minimal State Machines
Compatibility of States in Input-Independent Machines
A Method for Minimizing Incompletely Specified Sequential Machines
Comments on "Closure Partition Method for Minimizing Incomplete Sequential Machines"
Worst Case Bounds for Maximal Compatible Subsets
A Discussion on Two Algorithms for Determining Maximum Compatibles
Minimization of Incompletely Specified Sequential Machines
Further Comments on "Closure Partition Method for Minimizing Incomplete Sequential Machines"
An Efficient State Minimization Algorithm for Some Special Classes of Incompletely Specified Sequential Machines
Sequential Algorithm for the Determination of Maximum Compatibles
Closure Partition Method for Minimizing Incomplete Sequential Machines
State Reduction in Incompletely Specified Finite-State Machines
State Minimization of Incompletely Specified Sequential Machines
Slave Memories and Dynamic Storage Allocation
Minimal Closed Partitions for Incompletely Specified Flow Tables
The Conjectured Highest Scoring Machines for Rado's Σ(k) for the Value k = 4
An Algebraic Method for Minimizing the Number of States in an Incomplete Sequential Machine
Minimal solutions of Paull-Unger problems
Extending the Definition of Prime Compatibility Classes of States in Incomplete Sequential Machine Reduction
Simplification of Incompletely Specified Flow Tables with the Help of Prime Closed Sets
State Assignments in Combinational Networks
An Improved Method of Prime C-Class Derivation in the State Reduction of Sequential Networks
A New Rule for Reducing CC Tables
State Minimization of Incompletely Specified Sequential Machines
An Algebraic Proof of the Paull–Unger Theorem
A Decomposition Method of Determining Maximum Compatibles
Autonomous Clocks in Sequential Machines
A Note on State Minimization of a Special Class of Incomplete Sequential Machines
The Simplification of Sequential Machines with Input Restrictions
Unnamed Item
Unnamed Item
Unnamed Item
Unnamed Item
Unnamed Item
Unnamed Item

This page was built for publication: Minimal coverings for incompletely specified sequential machines