scientific article; zbMATH DE number 3254909
From MaRDI portal
Publication:5541342
zbMath0158.25801MaRDI QIDQ5541342
Publication date: 1962
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Related Items (73)
Analysis of periodic linear systems over finite fields with and without Floquet transform ⋮ On the complexity of existence of homing sequences for nondeterministic finite state machines ⋮ Checking sequences for distributed test architectures ⋮ MODEL PARTITIONS AND COMPACT TEST CASE SUITES ⋮ Deriving Homing Sequences for Finite State Machines with Timed Guards ⋮ On the Modeling of Sequential Reactive Systems by Means of Real Time Automata ⋮ On special properties of a composition of automata ⋮ Methods of constructing universal tests for finite-state automata ⋮ MODIFIED TRANSITION MATRIX AND FAULT TESTING IN SEQUENTIAL LOGIC CIRCUITS UNDER RANDOM STIMULI WITH A SPECIFIED MEASURE OF CONFIDENCE ⋮ Fault detection in cascaded automata ⋮ Weak equivalence of automata ⋮ Reversion of outputs of fuzzy discrete systems ⋮ Resolution-based approach to compatibility analysis of interacting automata ⋮ Lower bounds on lengths of checking sequences ⋮ The control problem for a cascade coupling of automata ⋮ A survey on observability of Boolean control networks ⋮ Transition matrices in the measurement and control of synchronous sequential machines ⋮ Tight bound on the length of distinguishing sequences for non-observable nondeterministic finite-state machines with a polynomial number of inputs and outputs ⋮ Experiments with nonstationary bilinear finite state machines ⋮ Hardness of Deriving Invertible Sequences from Finite State Machines ⋮ Evaluation and Comparison of Inferred Regular Grammars ⋮ Unnamed Item ⋮ A study on the extended unique input/output sequence ⋮ Developing a software system for automata-based code generation ⋮ Ring testing of discrete devices implementing polynomtal forms ⋮ Hardness and inapproximability of minimizing adaptive distinguishing sequences ⋮ The synchronization problem in protocol testing and its complexity ⋮ CRYPTANALYTIC CONCEPT OF FINITE AUTOMATON INVERTIBILITY WITH FINITE DELAY ⋮ Products of Automata and the Problem of Covering ⋮ ptype: probabilistic type inference ⋮ On deriving test suites for nondeterministic finite state machines with time-outs ⋮ FSM-based testing from user defined faults adapted to incremental and mutation testing ⋮ Bounded sequence testing from deterministic finite state machines ⋮ Complexity of automatic sequences ⋮ Fuzzy neural networks ⋮ Analysis and synthesis of abstract automata ⋮ Checking experiments for sequential machines ⋮ On homomorphic images of transition graphs ⋮ Finite automata and S-R models ⋮ ON THE REGULARITY OF SETS OF MULTI-ACCEPTED STRINGS OF A NON-DETERMINISTIC FINITE AUTOMATON ⋮ Transition submatrices in regular homing experiments and identification of sequential machines of known class using direct-sum transition matrices ⋮ Fuzzy Linear Automata Testing ⋮ Minimizing Coordination Channels in Distributed Testing ⋮ Koopman operator approach for computing structure of solutions and observability of nonlinear dynamical systems over finite fields ⋮ Applications of automata and graphs: Labeling operators in Hilbert space. II. ⋮ Estimation of the length of the shortest diagnostic word for a finite automaton ⋮ Testing from a stochastic timed system with a fault model ⋮ EURACE: A massively parallel agent-based model of the European economy ⋮ Random matrices and graphs ⋮ Fuzzy star functions, probabilistic automata, and their approximation by non-probabilistic automata ⋮ Improving performance in flexible manufacturing systems ⋮ Experiments with fuzzy finite state machines ⋮ Maximin, Minimax, and composite sequential machines ⋮ Time-varying sequential machines ⋮ Time-varying linear sequential machines. I ⋮ The semicircular law of free probability as noncommutative multivariable operator theory ⋮ Zur Theorie endlicher Automaten ⋮ Transition graphs of affine transformation on vector spaces over finite fields ⋮ Monadic Sequence Testing and Explicit Test-Refinements ⋮ Asynchronous automata ⋮ Comparative analysis of automata with a common input alphabet ⋮ Input-output modeling and identification of linear automata ⋮ Periodically externally hereditary permutational automata ⋮ Applications of automata and graphs: Labeling-operators in Hilbert space. I ⋮ Unnamed Item ⋮ Polynomial complete problems in automata theory ⋮ An axiom system for sequence-based specification ⋮ Establishing certain bounds concerning finite automata ⋮ Finite synchronous automata ⋮ Adaptive experiments for state identification in finite state machines with timeouts ⋮ Towards Deriving Test Sequences by Model Checking ⋮ PROBABILISTIC FINITE STATE SYSTEM IDENTIFICATION ⋮ Simplified analysis of finite automata
This page was built for publication:
