scientific article; zbMATH DE number 1165603

MaRDI QIDQ4396285zbMATH OpenFDO

Authors I. S. Grunskij, I. I. Maksimenko

Publication date 14 June 1998

zbMATH Keywords

class of automataconditions of identifying experimentsinput-output signalmarkers

Mathematics Subject Classification ID

Formal languages and automata (68Q45)

Recommendations

• Experiments with automata when the upper bound of the number of their states is unknown
• Topological properties of experiments on automata
• scientific article; zbMATH DE number 3868626
• scientific article; zbMATH DE number 2101008
• A note on homogeneous experiments with finite automata

Cited in

(22)

• Experiments with automata when the upper bound of the number of their states is unknown
• Topological properties of experiments on automata
• Automata recognition in effectively defined classes
• Presentations of automata in locally defined classes
• Automata characterisation through behaviour
• scientific article; zbMATH DE number 3846885 (Why is no real title available?)
• scientific article; zbMATH DE number 3868626 (Why is no real title available?)
• Some estimations for finite automata identification
• scientific article; zbMATH DE number 4011948 (Why is no real title available?)
• scientific article; zbMATH DE number 4051014 (Why is no real title available?)
• Kernel of a class of automata indistinguishable by a simple experiment
• Reconstruction of sequential machines by experiments
• scientific article; zbMATH DE number 45686 (Why is no real title available?)
• scientific article; zbMATH DE number 558366 (Why is no real title available?)
• On behaviour of automata in labyrinths
• scientific article; zbMATH DE number 1537560 (Why is no real title available?)
• On glueing states of an automaton
• On special properties of a composition of automata
• Transitions identification experiments with information-lossless automata
• Adjustment experiments for automata with variable logic of behaviour
• scientific article; zbMATH DE number 3222112 (Why is no real title available?)
• The design of checkable automata. I

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 Q4396285)