Least Upper Bounds on Minimal Terminal State Experiments for Two Classes of Sequential Machines
From MaRDI portal
Publication:5535949
DOI10.1145/321088.321098zbMath0156.17503OpenAlexW2097097579MaRDI QIDQ5535949
Publication date: 1961
Published in: Journal of the ACM (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1145/321088.321098
Related Items (7)
The complexity of checking the existence and derivation of adaptive synchronizing experiments for deterministic FSMs ⋮ Nonlinear automata over a finite ring ⋮ Transition submatrices in regular homing experiments and identification of sequential machines of known class using direct-sum transition matrices ⋮ Preset Distinguishing Sequences and Diameter of Transformation Semigroups ⋮ System identification via state characterization ⋮ Adaptive experiments for state identification in finite state machines with timeouts ⋮ Robot localization in a grid
This page was built for publication: Least Upper Bounds on Minimal Terminal State Experiments for Two Classes of Sequential Machines
