State-identification experiments in finite automata

DOI10.1016/S0019-9958(61)80003-XzbMath0129.26203OpenAlexW2028345614MaRDI QIDQ5338331

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

zbMATH Keywords

finite automatastate-identification experiments

Mathematics Subject Classification ID

Formal languages and automata (68Q45)

Related Items (13)

Limiting recursion ⋮ Physical versus computational complementarity. I ⋮ Deterministic automata. Simulation, universality and minimality ⋮ Transition matrices in the measurement and control of synchronous sequential machines ⋮ Adaptive distinguishing test cases of nondeterministic finite state machines: test case derivation and length estimation ⋮ Synchronizing Automata and the Černý Conjecture ⋮ Security Analysis of Cache Replacement Policies ⋮ 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 ⋮ Preset Distinguishing Sequences and Diameter of Transformation Semigroups ⋮ Černý's conjecture and the road colouring problem ⋮ System identification via state characterization

This page was built for publication: State-identification experiments in finite automata