The following pages link to (Q5541342):
Displaying 50 items.
- On the complexity of existence of homing sequences for nondeterministic finite state machines (Q300305) (← links)
- Tight bound on the length of distinguishing sequences for non-observable nondeterministic finite-state machines with a polynomial number of inputs and outputs (Q413312) (← links)
- A study on the extended unique input/output sequence (Q456677) (← links)
- Hardness and inapproximability of minimizing adaptive distinguishing sequences (Q479811) (← links)
- Analysis and synthesis of abstract automata (Q548753) (← links)
- Transition submatrices in regular homing experiments and identification of sequential machines of known class using direct-sum transition matrices (Q580161) (← links)
- Lower bounds on lengths of checking sequences (Q613138) (← links)
- Experiments with fuzzy finite state machines (Q747332) (← links)
- Experiments with nonstationary bilinear finite state machines (Q904455) (← links)
- Bounded sequence testing from deterministic finite state machines (Q964395) (← links)
- Testing from a stochastic timed system with a fault model (Q1001893) (← links)
- Improving performance in flexible manufacturing systems (Q1014568) (← links)
- Applications of automata and graphs: Labeling-operators in Hilbert space. I (Q1038729) (← links)
- An axiom system for sequence-based specification (Q1044834) (← links)
- Resolution-based approach to compatibility analysis of interacting automata (Q1127549) (← links)
- Transition matrices in the measurement and control of synchronous sequential machines (Q1144377) (← links)
- The synchronization problem in protocol testing and its complexity (Q1183455) (← links)
- Fuzzy neural networks (Q1213388) (← links)
- Checking experiments for sequential machines (Q1217077) (← links)
- Finite automata and S-R models (Q1230763) (← links)
- On deriving test suites for nondeterministic finite state machines with time-outs (Q1758706) (← links)
- FSM-based testing from user defined faults adapted to incremental and mutation testing (Q1758717) (← links)
- Polynomial complete problems in automata theory (Q1838038) (← links)
- Establishing certain bounds concerning finite automata (Q1844548) (← links)
- ptype: probabilistic type inference (Q1987195) (← links)
- Koopman operator approach for computing structure of solutions and observability of nonlinear dynamical systems over finite fields (Q2036487) (← links)
- The semicircular law of free probability as noncommutative multivariable operator theory (Q2062297) (← links)
- Adaptive experiments for state identification in finite state machines with timeouts (Q2104144) (← links)
- Analysis of periodic linear systems over finite fields with and without Floquet transform (Q2120447) (← links)
- Developing a software system for automata-based code generation (Q2216713) (← links)
- Checking sequences for distributed test architectures (Q2377256) (← links)
- Methods of constructing universal tests for finite-state automata (Q2386493) (← links)
- EURACE: A massively parallel agent-based model of the European economy (Q2518627) (← links)
- Random matrices and graphs (Q2522339) (← links)
- Fuzzy star functions, probabilistic automata, and their approximation by non-probabilistic automata (Q2526761) (← links)
- Maximin, Minimax, and composite sequential machines (Q2536526) (← links)
- Time-varying sequential machines (Q2538134) (← links)
- Time-varying linear sequential machines. I (Q2538531) (← links)
- Zur Theorie endlicher Automaten (Q2543194) (← links)
- Transition graphs of affine transformation on vector spaces over finite fields (Q2543462) (← links)
- Asynchronous automata (Q2545683) (← links)
- Input-output modeling and identification of linear automata (Q2552101) (← links)
- Monadic Sequence Testing and Explicit Test-Refinements (Q2827440) (← links)
- Towards Deriving Test Sequences by Model Checking (Q2873605) (← links)
- MODEL PARTITIONS AND COMPACT TEST CASE SUITES (Q2909189) (← links)
- Hardness of Deriving Invertible Sequences from Finite State Machines (Q2971131) (← links)
- Applications of automata and graphs: Labeling operators in Hilbert space. II. (Q3069126) (← links)
- Evaluation and Comparison of Inferred Regular Grammars (Q3528425) (← links)
- Minimizing Coordination Channels in Distributed Testing (Q3613091) (← links)
- MODIFIED TRANSITION MATRIX AND FAULT TESTING IN SEQUENTIAL LOGIC CIRCUITS UNDER RANDOM STIMULI WITH A SPECIFIED MEASURE OF CONFIDENCE (Q3741577) (← links)
