scientific article; zbMATH DE number 3598362
From MaRDI portal
Publication:4165287
zbMath0384.94020MaRDI QIDQ4165287
Publication date: 1978
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Lua error in Module:PublicationMSCList at line 37: attempt to index local 'msc_result' (a nil value).
Related Items (31)
Exact solutions for the construction of optimal length test sequences ⋮ On the complexity of existence of homing sequences for nondeterministic finite state machines ⋮ Boolean delay equations. II: Periodic and aperiodic solutions ⋮ Modeling for Verification ⋮ Indentification of inductive properties during verification of synchronous sequential circuits ⋮ Masking traveling beams: optical solutions for NP-complete problems, trading space for time ⋮ Deriving Homing Sequences for Finite State Machines with Timed Guards ⋮ The temporal boolean derivative applied to verification of extended finite state machines ⋮ Optimal control of multiclass parallel service systems ⋮ Symmetric multi-valued logic functions: characterization and synthesis ⋮ Lower bounds on lengths of checking sequences ⋮ Simulation of problems in propositional calculus ⋮ On Formal Equivalence Verification of Hardware ⋮ Static state feedback control of asynchronous sequential machines ⋮ Hardness of Deriving Invertible Sequences from Finite State Machines ⋮ Adaptive distinguishing test cases of nondeterministic finite state machines: test case derivation and length estimation ⋮ Hardness and inapproximability of minimizing adaptive distinguishing sequences ⋮ On the Difference Between Finite-State and Pushdown Depth ⋮ Generalized ternary simulation of sequential circuits ⋮ Synthesis of distinguishing test cases for timed finite state machines ⋮ The computational beauty of flocking: boids revisited ⋮ Automatic defensive control of asynchronous sequential machines ⋮ Efficient Computation of the Best Quadratic Approximations of Cubic Boolean Functions ⋮ Preset and Adaptive Homing Experiments for Nondeterministic Finite State Machines ⋮ The relation between preset distinguishing sequences and synchronizing sequences ⋮ Dimension extractors and optimal decompression ⋮ The least channel capacity for chaos synchronization ⋮ A VLSI design for the parallel finite state automaton and its performance evaluation as a hardware scanner ⋮ The power of a pebble: Exploring and mapping directed graphs ⋮ Adaptive experiments for state identification in finite state machines with timeouts ⋮ Identification of Discrete Event Systems Using the Compound Recurrent Neural Network: Extracting DEVS from Trained Network
This page was built for publication:
