State-identification experiments in finite automata
From MaRDI portal
Publication:5338331
DOI10.1016/S0019-9958(61)80003-XzbMATH Open0129.26203OpenAlexW2028345614MaRDI QIDQ5338331FDOQ5338331
Authors: Arthur Gill 
Publication date: 1961
Published in: Information and Control (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/s0019-9958(61)80003-x
Cited In (16)
- Preset distinguishing sequences and diameter of transformation semigroups
- System identification via state characterization
- Computational complementarity and shift spaces
- Transition submatrices in regular homing experiments and identification of sequential machines of known class using direct-sum transition matrices
- Experiments with automata when the upper bound of the number of their states is unknown
- Physical versus computational complementarity. I
- Security Analysis of Cache Replacement Policies
- Transition matrices in the measurement and control of synchronous sequential machines
- Title not available (Why is that?)
- Deterministic automata. Simulation, universality and minimality
- Preset and adaptive homing experiments for nondeterministic finite state machines
- Černý's conjecture and the road colouring problem
- State identification, existence of sequences and machine classification
- Synchronizing Automata and the Černý Conjecture
- Adaptive distinguishing test cases of nondeterministic finite state machines: test case derivation and length estimation
- Limiting recursion
This page was built for publication: State-identification experiments in finite automata
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5338331)
