Automata recognition in effectively defined classes (Q2735907)

The paper deals with recognizing or identifying experiments on infinite classes of Mealy Finite State Machines (FSM). The class for which the experiments exist is called recognizable. The author shows that any recursively enumerable class \(B\) with Bair metric has a sequence of recursively enumerable recognizable subclasses \(B_1,\dots, B_n,\dots\) and \(B_{n-1}= \lim B_n\). The central point of the paper is investigation of the FSM's class defined by an nondeterministic FSM, and called finitely definable. It is shown that for any such class \(B\) the subclass \(\lim B\) is finitely definable too and opening subclass \(]\lim B[\) is recognizable.