On the public citation graph
Minimal coverings for incompletely specified sequential machines
0 signed · 76 inferred · view as graph
Inferred edges come from two machine sources: sweeps of open repository metadata (mostly SSRN and Zenodo), and a bulk OpenAlex citation snapshot. Every row below is labelled with the one it came from. Neither is a complete citation index — absence here is not evidence of absence.
Is this your work? Sign in with ORCID and put your name on the
claims that are yours.
Reference health. See whether every reference in this work resolves to a
known work and none has been retracted — and get a dated CiteStamped
badge you can embed.
What this work says
Outgoing claims: the papers this work cites, builds on, or argues with.
inferredcites →https://doi.org/10.1002/j.1538-7305.1962.tb00491.xopenalex-snapshot
Minimum-State Sequential Circuits for a Restricted Class of Incompletely Specified Flow Tables*
inferredcites →https://doi.org/10.1007/978-3-322-96644-5openalex-snapshot
Universal Theory of Automata
inferredcites →https://doi.org/10.1007/bf01695628openalex-snapshot
Minimal solutions of Paull-Unger problems
inferredcites →https://doi.org/10.1007/bf03047026openalex-snapshot
On the synthesis of finite sequential machines
inferredcites →https://doi.org/10.1016/b978-0-12-417750-5.50022-1openalex-snapshot
AN n log n ALGORITHM FOR MINIMIZING STATES IN A FINITE AUTOMATON
inferredcites →https://doi.org/10.1017/cbo9780511816239openalex-snapshot
Switching and Finite Automata Theory
inferredcites →https://doi.org/10.1049/el:19790491openalex-snapshot
Minimisation of incompletely specified sequential machines: the ‘really’ excluded compatibility classes
inferredcites →https://doi.org/10.1049/ep.1980.0099openalex-snapshot
Logic Design and Switching Theory
inferredcites →https://doi.org/10.1049/ree.1972.0088openalex-snapshot
A computer algorithm for state table reduction
inferredcites →https://doi.org/10.1109/focs.1962.14openalex-snapshot
Some theorems for incompletely specified sequential machines with applications to state minimization
inferredcites →https://doi.org/10.1109/pgec.1965.264139openalex-snapshot
State Assignments in Combinational Networks
inferredcites →https://doi.org/10.1109/pgec.1965.264140openalex-snapshot
A Method for Minimizing the Number of Internal States in Incompletely Specified Sequential Networks
inferredcites →https://doi.org/10.1109/pgec.1965.264156openalex-snapshot
Autonomous Clocks in Sequential Machines
inferredcites →https://doi.org/10.1109/pgec.1965.264157openalex-snapshot
Flow Table Simplification-Some Useful Aids
inferredcites →https://doi.org/10.1109/pgec.1965.264260openalex-snapshot
Some Remarks on State Reduction of Asynchronous Circuits by the Paull-Unger Method
inferredcites →https://doi.org/10.1109/pgec.1965.264263openalex-snapshot
Slave Memories and Dynamic Storage Allocation
inferredcites →https://doi.org/10.1109/pgec.1966.264308openalex-snapshot
Minimal Closed Partitions for Incompletely Specified Flow Tables
inferredcites →https://doi.org/10.1109/pgec.1966.264573openalex-snapshot
Reduction of the Number of Columns in Flow Table Minimization
inferredcites →https://doi.org/10.1109/pgec.1967.264673openalex-snapshot
Parallel Logic with Charge Storage Techniques
inferredcites →https://doi.org/10.1109/pgec.1967.264674openalex-snapshot
A Note on Internal State Minimization in Incompletely Specified Sequential Networks
inferredcites →https://doi.org/10.1109/proc.1963.2312openalex-snapshot
A survey of switching circuit theory
inferredcites →https://doi.org/10.1109/proc.1969.7028openalex-snapshot
On finding maximum compatibles
inferredcites →https://doi.org/10.1109/swat.1966.1openalex-snapshot
A method for the combined row-column reduction of flow tables
inferredcites →https://doi.org/10.1109/t-c.1969.222552openalex-snapshot
Simplification of Incompletely Specified Flow Tables with the Help of Prime Closed Sets
inferredcites →https://doi.org/10.1109/t-c.1969.222706openalex-snapshot
Extending the Definition of Prime Compatibility Classes of States in Incomplete Sequential Machine Reduction
inferredcites →https://doi.org/10.1109/t-c.1970.222842openalex-snapshot
A New Rule for Reducing CC Tables
inferredcites →https://doi.org/10.1109/t-c.1970.222920openalex-snapshot
State Minimization of Incompletely Specified Sequential Machines
inferredcites →https://doi.org/10.1109/t-c.1971.223221openalex-snapshot
An Improved Method of Prime C-Class Derivation in the State Reduction of Sequential Networks
inferredcites →https://doi.org/10.1109/t-c.1971.223294openalex-snapshot
An Algebraic Proof of the Paull–Unger Theorem
inferredcites →https://doi.org/10.1109/t-c.1971.223375openalex-snapshot
On the Determination of Irredundant Prime Closed Sets
inferredcites →https://doi.org/10.1109/t-c.1972.223521openalex-snapshot
The Simplification of Sequential Machines with Input Restrictions
inferredcites →https://doi.org/10.1109/t-c.1972.223549openalex-snapshot
A Note on State Minimization of a Special Class of Incomplete Sequential Machines
inferredcites →https://doi.org/10.1109/t-c.1973.223655openalex-snapshot
State Reduction in Incompletely Specified Finite-State Machines
inferredcites →https://doi.org/10.1109/t-c.1973.223657openalex-snapshot
Closure Partition Method for Minimizing Incomplete Sequential Machines
inferredcites →https://doi.org/10.1109/t-c.1974.223780openalex-snapshot
State Minimization of Incompletely Specified Sequential Machines
inferredcites →https://doi.org/10.1109/t-c.1974.223786openalex-snapshot
Sequential Algorithm for the Determination of Maximum Compatibles
inferredcites →https://doi.org/10.1109/t-c.1975.224090openalex-snapshot
Comments on "Closure Partition Method for Minimizing Incomplete Sequential Machines"
inferredcites →https://doi.org/10.1109/t-c.1975.224137openalex-snapshot
Minimization of Incompletely Specified Sequential Machines
inferredcites →https://doi.org/10.1109/t-c.1975.224315openalex-snapshot
Worst Case Bounds for Maximal Compatible Subsets
inferredcites →https://doi.org/10.1109/t-c.1975.224318openalex-snapshot
A Discussion on Two Algorithms for Determining Maximum Compatibles
inferredcites →https://doi.org/10.1109/tc.1968.229126openalex-snapshot
An Algebraic Method for Minimizing the Number of States in an Incomplete Sequential Machine
inferredcites →https://doi.org/10.1109/tc.1972.5008956openalex-snapshot
A Decomposition Method of Determining Maximum Compatibles
inferredcites →https://doi.org/10.1109/tc.1976.1674690openalex-snapshot
Further Comments on "Closure Partition Method for Minimizing Incomplete Sequential Machines"
inferredcites →https://doi.org/10.1109/tc.1979.1675400openalex-snapshot
An Efficient State Minimization Algorithm for Some Special Classes of Incompletely Specified Sequential Machines
inferredcites →https://doi.org/10.1109/tc.1980.1675655openalex-snapshot
A Method for Minimizing Incompletely Specified Sequential Machines
inferredcites →https://doi.org/10.1109/tec.1959.5222056openalex-snapshot
Synthesis of Minimal-State Machines
inferredcites →https://doi.org/10.1109/tec.1959.5222696openalex-snapshot
A Technique for the Reduction of a Given Machine to a Minimal-State Machine
inferredcites →https://doi.org/10.1109/tec.1959.5222697openalex-snapshot
Minimizing the Number of States in Incompletely Specified Sequential Switching Functions
inferredcites →https://doi.org/10.1109/tec.1959.5222756openalex-snapshot
A Synthesis Technique for Minimal State Sequential Machines
inferredcites →https://doi.org/10.1109/tec.1961.5219246openalex-snapshot
Minimizing Incompletely Specified Sequential Switching Functions
inferredcites →https://doi.org/10.1145/320964.320983openalex-snapshot
On the Reduction of Superfluous States in a Sequential Machine
inferredcites →https://doi.org/10.1145/321043.321045openalex-snapshot
Connective Properties Preserved in Minimal State Machines
inferredcites →https://doi.org/10.1145/321075.321083openalex-snapshot
Compatibility of States in Input-Independent Machines
inferredcites →https://doi.org/10.1147/rd.85.0537openalex-snapshot
Derivation of Maximal Compatibles Using Boolean Algebra
What points at this work
Incoming claims: where this work appears in other papers’ reference lists and arguments.
inferred← citeshttps://doi.org/10.1002/cta.4490160403openalex-snapshot
Computer‐aided design and optimization of control units for VLSI processors
inferred← citeshttps://doi.org/10.1007/3-540-57601-0_52openalex-snapshot
An algebraic transformation of the minimum automaton identification problem
inferred← citeshttps://doi.org/10.1007/978-3-032-28404-4_12openalex-snapshot
Minimizing Streaming String Transducers: An Algebraic Approach
inferred← citeshttps://doi.org/10.1007/978-94-009-3649-2_9openalex-snapshot
Synthesis of Control Systems
inferred← citeshttps://doi.org/10.1007/bf02127799openalex-snapshot
Exact complexity of problems of incompletely specified automata
inferred← citeshttps://doi.org/10.1007/bfb0021016openalex-snapshot
A transformation of the problems of minimal satisfaction of constraints
inferred← citeshttps://doi.org/10.1016/0022-0000(90)90009-aopenalex-snapshot
First-order spectra with one variable
inferred← citeshttps://doi.org/10.1016/s0045-7906(00)00016-1openalex-snapshot
A heuristic algorithm for the minimization of incompletely specified finite state machines
inferred← citeshttps://doi.org/10.1049/ip-cdt:19941228openalex-snapshot
State merging and state splitting via state assignment: a new FSM synthesis algorithm
inferred← citeshttps://doi.org/10.1049/ip-e.1992.0070openalex-snapshot
Efficient state reduction methods for PLA-based sequential circuits
inferred← citeshttps://doi.org/10.1109/43.229748openalex-snapshot
An efficient algorithm to search for minimal closed covers in sequential machines
inferred← citeshttps://doi.org/10.1109/43.259940openalex-snapshot
Exact and heuristic algorithms for the minimization of incompletely specified state machines
inferred← citeshttps://doi.org/10.1109/edac.1991.206387openalex-snapshot
Exact and heuristic algorithms for the minimization of incompletely specified state machines
inferred← citeshttps://doi.org/10.1109/iccd.1992.276281openalex-snapshot
The role of prime compatibles in the minimization of finite state machines
inferred← citeshttps://doi.org/10.1109/iscas.1990.112075openalex-snapshot
New approach to the state reduction in incompletely specified sequential machines
inferred← citeshttps://doi.org/10.1109/iscas.1991.176749openalex-snapshot
SMAS: a program for the concurrent state reduction and state assignment of finite state machines
inferred← citeshttps://doi.org/10.1109/iscc.1998.702643openalex-snapshot
Comparative analysis of the notions of equivalence for process specifications
inferred← citeshttps://doi.org/10.1109/isic.1992.225090openalex-snapshot
Controllability, reachability, stabilizability and state reduction in automata
inferred← citeshttps://doi.org/10.1137/0219028openalex-snapshot
A Nontrivial Lower Bound for an NP Problem on Automata
inferred← citeshttps://doi.org/10.5555/951513.951554openalex-snapshot
Exact and heuristic algorithms for the minimization of incompletely specified state machines
Editorial review for independent work. ICSAC — the Institute for Complexity
Science and Advanced Computing — runs a structured editorial panel for researchers
publishing outside journals, and publishes on CiteStamp rails. Submission is free
and goes through ORCID: icsacinstitute.org/submit.