In this paper, we study arbitrary regular factorial languages over a finite alphabet ?. For the set of words L(n) length n belonging to language L, investigate depth decision trees solving recognition and membership problems deterministically nondeterministically. case problem, for given word from L(n), should recognize it using queries each which, some i?{1,…,n}, returns ith letter word. ? n, ...