About simple conditional experiments identifying invertible automata of a certain class

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$.