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.34406OpenAlexW1968703352MaRDI 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
Über die Konstruktion nichtvollständiger automaten, Composition Sequences and Synchronizing Automata, Physical versus computational complementarity. I, Deterministic automata. Simulation, universality and minimality, Transition matrices in the measurement and control of synchronous sequential machines, Synchronizing words under \textsf{LTL} constraints, Synchronizing Automata and the Černý Conjecture, Algorithms for media, Transition submatrices in regular homing experiments and identification of sequential machines of known class using direct-sum transition matrices, Preset and Adaptive Homing Experiments for Nondeterministic Finite State Machines, Computational complementarity and shift spaces, System identification via state characterization, Synchronizing words for real-time deterministic pushdown automata (extended abstract), Composition sequences for functions over a finite domain.
