About simple conditional experiments identifying invertible automata of a certain class
Prikladnaya Diskretnaya Matematika. Supplement, no. 9 (2016)
Cet article a éte moissonné depuis la source Math-Net.Ru
It is shown that, for any class of strongly connected automata obtained from an initialized invertible automaton $R$ by changing its transition function in dependence on a key, there exists an identifying experiment of a length not more than $mn(m+3)/2$, where $m$ and $n$ are the numbers of states and input (output) symbols respectively in $R$.
Keywords:
initialized automaton, strongly connected automaton, simple adaptive experiments.
Mots-clés : invertible automaton, automaton identification
Mots-clés : invertible automaton, automaton identification
@article{PDMA_2016_9_a44,
author = {A. O. Zhukovskaja and V. N. Trenkaev},
title = {About simple conditional experiments identifying invertible automata of a~certain class},
journal = {Prikladnaya Diskretnaya Matematika. Supplement},
pages = {115},
year = {2016},
number = {9},
language = {ru},
url = {http://geodesic.mathdoc.fr/item/PDMA_2016_9_a44/}
}
TY - JOUR AU - A. O. Zhukovskaja AU - V. N. Trenkaev TI - About simple conditional experiments identifying invertible automata of a certain class JO - Prikladnaya Diskretnaya Matematika. Supplement PY - 2016 SP - 115 IS - 9 UR - http://geodesic.mathdoc.fr/item/PDMA_2016_9_a44/ LA - ru ID - PDMA_2016_9_a44 ER -
A. O. Zhukovskaja; V. N. Trenkaev. About simple conditional experiments identifying invertible automata of a certain class. Prikladnaya Diskretnaya Matematika. Supplement, no. 9 (2016). http://geodesic.mathdoc.fr/item/PDMA_2016_9_a44/
[1] Trenkaev V. N., “Realizatsiya shifra Zakrevskogo na osnove perestraivaemogo avtomata”, Prikladnaya diskretnaya matematika, 2010, no. 3, 69–76