State-identification experiments in finite automata

DOI10.1016/S0019-9958(61)80003-XMaRDI QIDQ5338331zbMATH OpenOpenAlexFDO

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

zbMATH Keywords

finite automatastate-identification experiments

Mathematics Subject Classification ID

Formal languages and automata (68Q45)

Cited in

(16)

• Transition matrices in the measurement and control of synchronous sequential machines
• Physical versus computational complementarity. I
• Deterministic automata. Simulation, universality and minimality
• Experiments with automata when the upper bound of the number of their states is unknown
• Adaptive distinguishing test cases of nondeterministic finite state machines: test case derivation and length estimation
• Černý's conjecture and the road colouring problem
• System identification via state characterization
• Preset distinguishing sequences and diameter of transformation semigroups
• Security Analysis of Cache Replacement Policies
• Synchronizing Automata and the Černý Conjecture
• scientific article; zbMATH DE number 5638055 (Why is no real title available?)
• Preset and adaptive homing experiments for nondeterministic finite state machines
• Limiting recursion
• Transition submatrices in regular homing experiments and identification of sequential machines of known class using direct-sum transition matrices
• State identification, existence of sequences and machine classification
• Computational complementarity and shift spaces

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)