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