On the Length of the Smallest Uniform Experiment which Distinguishes the Terminal States of a Machine
From MaRDI portal
Publication:3261701
DOI10.1145/320932.320938zbMath0088.34406MaRDI QIDQ3261701
Publication date: 1958
Published in: Journal of the ACM (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1145/320932.320938
Related Items
Preset and Adaptive Homing Experiments for Nondeterministic Finite State Machines, Über die Konstruktion nichtvollständiger automaten, Transition submatrices in regular homing experiments and identification of sequential machines of known class using direct-sum transition matrices, Algorithms for media, Computational complementarity and shift spaces, Transition matrices in the measurement and control of synchronous sequential machines, Physical versus computational complementarity. I, Deterministic automata. Simulation, universality and minimality, Composition sequences for functions over a finite domain., System identification via state characterization, Composition Sequences and Synchronizing Automata, Synchronizing Automata and the Černý Conjecture