scientific article; zbMATH DE number 3328721
From MaRDI portal
zbMath0206.47701MaRDI QIDQ5606985
Publication date: 1970
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Introductory exposition (textbooks, tutorial papers, etc.) pertaining to computer science (68-01) Formal languages and automata (68Q45) Theory of error-correcting codes and error-detecting codes (94B99) Coding theorems (Shannon theory) (94A24)
Related Items
An optimum testing algorithm for some symmetric coherent systems, An algorithm for hazard-free minimization of incompletely specified switching function, Finite-state dimension, Minimal coverings for incompletely specified sequential machines, On path equivalence of nondeterministic finite automata, Synchronizing Sequences for Probabilistic Automata, An algorithm to generate complete test sets for stuck-at faults in combinational logic circuits, Complexity of reachability problems for finite discrete dynamical systems, The forbidden projections of unate functions, The complexity of checking the existence and derivation of adaptive synchronizing experiments for deterministic FSMs, An algebraic technique for generating optimal CMOS circuitry in linear time, An algorithm for stuck-at fault coverage analysis of combinational and sequential logic circuits, Stratification and knowledge base management, Common knowledge and update in finite environments, Adaptive control of asynchronous sequential machines with state feedback, A theory of discontinuities in physical system models, Pushdown and Lempel-Ziv depth, Stochastic combinational networks, Memory Reduction for Strategies in Infinite Games, Bursts and output feedback control of non-deterministic asynchronous sequential machines, Reachability problems for sequential dynamical systems with threshold functions., From bidirectionality to alternation., Output feedback control of asynchronous sequential machines with disturbance inputs, Runtime analysis of the \((1+1)\) EA on computing unique input output sequences, On data retrieval from unambiguous bit matrices, Les automates circulaires biaisés vérifient la conjecture de Černý, State identification, existence of sequences and machine classification, An incremental method for generating prime implicants/implicates, Quadratic automata, Synchronization paradigm for protocol testing under multiparty configuration, Synchronizing Automata and the Černý Conjecture, Synthesis of autosymmetric functions in a new three-level form, A generalized if-then-else operator for the representation of multi-output functions, Predecessor existence problems for finite discrete dynamical systems, Surface Dimension, Tiles, and Synchronizing Automata, Computing the optimal IO sequences of a protocol in polynomial time, Picture codes and deciphering delay, Characterizing diagnoses and systems, A multi-parameter analysis of hard problems on deterministic finite automata, Analysis and synthesis of abstract automata, Checking experiments for sequential machines, Testing timed automata, New directions in fuzzy automata, A new normal form of Boolean functions, Model matching inclusion for input/state asynchronous sequential machines, Transition submatrices in regular homing experiments and identification of sequential machines of known class using direct-sum transition matrices, Preset Distinguishing Sequences and Diameter of Transformation Semigroups, Analytic methods for reachability problems, The concept of a linguistic variable and its application to approximate reasoning. I, The concept of a linguistic variable and its application to approximate reasoning. II, The concept of a linguistic variable and its application to approximate reasoning. III, Quantified data automata for linear data structures: a register automaton model with applications to learning invariants of programs manipulating arrays and lists, An extremal problem in the hypercube and optimization of asynchronous circuits, System identification via state characterization, A simpler method for minimization of switching functions, A comprehensive methodology for building hybrid models of physical systems, Establishing certain bounds concerning finite automata, Multiple-entry finite automata, Decomposable fuzzy-valued switching functions, Reduced checking sequences using unreliable reset, Sync-maximal permutation groups equal primitive permutation groups, Spiking neurons and the induction of finite state machines., Theory revision with queries: Horn, read-once, and parity formulas
