Publication:4165287
From MaRDI portal
zbMath0384.94020MaRDI QIDQ4165287
Publication date: 1978
68-01: Introductory exposition (textbooks, tutorial papers, etc.) pertaining to computer science
68Q45: Formal languages and automata
94C99: Circuits, networks
94C05: Analytic circuit theory
94B99: Theory of error-correcting codes and error-detecting codes
94-01: Introductory exposition (textbooks, tutorial papers, etc.) pertaining to information and communication theory
Related Items
Generalized ternary simulation of sequential circuits, Preset and Adaptive Homing Experiments for Nondeterministic Finite State Machines, Efficient Computation of the Best Quadratic Approximations of Cubic Boolean Functions, On the complexity of existence of homing sequences for nondeterministic finite state machines, Hardness and inapproximability of minimizing adaptive distinguishing sequences, Lower bounds on lengths of checking sequences, The relation between preset distinguishing sequences and synchronizing sequences, Masking traveling beams: optical solutions for NP-complete problems, trading space for time, Dimension extractors and optimal decompression, Boolean delay equations. II: Periodic and aperiodic solutions, Exact solutions for the construction of optimal length test sequences, Adaptive distinguishing test cases of nondeterministic finite state machines: test case derivation and length estimation, Synthesis of distinguishing test cases for timed finite state machines, The power of a pebble: Exploring and mapping directed graphs, Indentification of inductive properties during verification of synchronous sequential circuits, The temporal boolean derivative applied to verification of extended finite state machines, Optimal control of multiclass parallel service systems, Automatic defensive control of asynchronous sequential machines, The least channel capacity for chaos synchronization, Static state feedback control of asynchronous sequential machines, Hardness of Deriving Invertible Sequences from Finite State Machines, Identification of Discrete Event Systems Using the Compound Recurrent Neural Network: Extracting DEVS from Trained Network, Modeling for Verification, Symmetric multi-valued logic functions: characterization and synthesis, Simulation of problems in propositional calculus, On Formal Equivalence Verification of Hardware, The computational beauty of flocking: boids revisited, A VLSI design for the parallel finite state automaton and its performance evaluation as a hardware scanner
