This article is cited in 1 paper

Applied Theory of Automata and Graphs

About simple conditional experiments identifying invertible automata of a certain class

A. O. Zhukovskaja, V. N. Trenkaev

Tomsk State University, Tomsk

Abstract: 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, invertible automaton, strongly connected automaton, automaton identification, simple adaptive experiments.

UDC: 519.713.4

DOI: 10.17223/2226308X/9/45