scientific article; zbMATH DE number 4041277

MaRDI QIDQ3779752zbMATH OpenFDO

Authors I. S. Grunskij

Publication date 1986

zbMATH Keywords

finite automatoni-indistinguishabilityinput-output word

Mathematics Subject Classification ID

Formal languages and automata (68Q45)

Recommendations

• scientific article; zbMATH DE number 4051014
• Indistinguishability of finite automata by multiple experiments in a stationary observation medium
• On behaviour of automata in labyrinths
• scientific article; zbMATH DE number 51656
• Indistinguishability of finite automata with constrained behavior

Cited in

(10)

• scientific article; zbMATH DE number 4011948 (Why is no real title available?)
• Experiments with automata when the upper bound of the number of their states is unknown
• Indistinguishability of finite-state automata with respect to some environments
• scientific article; zbMATH DE number 3222112 (Why is no real title available?)
• On distinguishability of states of automata
• Kernel of a class of automata indistinguishable by a simple experiment
• Indistinguishability of finite automata by multiple experiments in a stationary observation medium
• scientific article; zbMATH DE number 3860396 (Why is no real title available?)
• scientific article; zbMATH DE number 4051014 (Why is no real title available?)
• Identification of finite automata based on distribution of output \(m\)- tuples. II.

This page was built for publication:

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3779752)