scientific article; zbMATH DE number 3328721
From MaRDI portal
Publication:5606985
Cited in
(63)- Surface dimension, tiles, and synchronizing automata
- 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
- 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
- Synchronizing Sequences for Probabilistic Automata
- Analysis and synthesis of abstract automata
- The complexity of checking the existence and derivation of adaptive synchronizing experiments for deterministic FSMs
- Reduced checking sequences using unreliable reset
- New directions in fuzzy automata
- Synthesis of autosymmetric functions in a new three-level form
- Preset distinguishing sequences and diameter of transformation semigroups
- System identification via state characterization
- 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
- Testing timed automata
- Pushdown and Lempel-Ziv depth
- 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
- Memory Reduction for Strategies in Infinite Games
- Reachability problems for sequential dynamical systems with threshold functions.
- Stochastic combinational networks
- Spiking neurons and the induction of finite state machines.
- Finite-state dimension
- An algebraic technique for generating optimal CMOS circuitry in linear time
- Sync-maximal permutation groups equal primitive permutation groups
- Analytic methods for reachability problems
- 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
- A simpler method for minimization of switching functions
- Common knowledge and update in finite environments
- An incremental method for generating prime implicants/implicates
- Checking experiments for sequential machines
- An algorithm for hazard-free minimization of incompletely specified switching function
- On data retrieval from unambiguous bit matrices
- 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
- Decomposable fuzzy-valued switching functions
- Synchronizing Automata and the Černý Conjecture
- 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
- Adaptive control of asynchronous sequential machines with state feedback
- An optimum testing algorithm for some symmetric coherent systems
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)
