The following pages link to (Q4165287):
Displaying 31 items.
- On the complexity of existence of homing sequences for nondeterministic finite state machines (Q300305) (← links)
- Hardness and inapproximability of minimizing adaptive distinguishing sequences (Q479811) (← links)
- Lower bounds on lengths of checking sequences (Q613138) (← links)
- The relation between preset distinguishing sequences and synchronizing sequences (Q736851) (← links)
- Masking traveling beams: optical solutions for NP-complete problems, trading space for time (Q847661) (← links)
- Dimension extractors and optimal decompression (Q1015378) (← links)
- Boolean delay equations. II: Periodic and aperiodic solutions (Q1092243) (← links)
- Exact solutions for the construction of optimal length test sequences (Q1334626) (← links)
- Adaptive distinguishing test cases of nondeterministic finite state machines: test case derivation and length estimation (Q1707350) (← links)
- Synthesis of distinguishing test cases for timed finite state machines (Q1758682) (← links)
- The power of a pebble: Exploring and mapping directed graphs (Q1854539) (← links)
- Indentification of inductive properties during verification of synchronous sequential circuits (Q1893131) (← links)
- The temporal boolean derivative applied to verification of extended finite state machines (Q1903776) (← links)
- Optimal control of multiclass parallel service systems (Q1916032) (← links)
- Adaptive experiments for state identification in finite state machines with timeouts (Q2104144) (← links)
- Automatic defensive control of asynchronous sequential machines (Q2792709) (← links)
- The least channel capacity for chaos synchronization (Q2821504) (← links)
- Static state feedback control of asynchronous sequential machines (Q2964404) (← links)
- Hardness of Deriving Invertible Sequences from Finite State Machines (Q2971131) (← links)
- Identification of Discrete Event Systems Using the Compound Recurrent Neural Network: Extracting DEVS from Trained Network (Q3148237) (← links)
- Modeling for Verification (Q3176361) (← links)
- On the Difference Between Finite-State and Pushdown Depth (Q3297767) (← links)
- Symmetric multi-valued logic functions: characterization and synthesis (Q3481655) (← links)
- Simulation of problems in propositional calculus (Q3495196) (← links)
- On Formal Equivalence Verification of Hardware (Q3503620) (← links)
- The computational beauty of flocking: boids revisited (Q3592327) (← links)
- A VLSI design for the parallel finite state automaton and its performance evaluation as a hardware scanner (Q3677666) (← links)
- Generalized ternary simulation of sequential circuits (Q4365005) (← links)
- Deriving Homing Sequences for Finite State Machines with Timed Guards (Q5060074) (← links)
- Preset and Adaptive Homing Experiments for Nondeterministic Finite State Machines (Q5200066) (← links)
- Efficient Computation of the Best Quadratic Approximations of Cubic Boolean Functions (Q5447509) (← links)
