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