Consideration was given to the problem of identification of discrete objects which was reduced to analytical identification of the tabular functions. By the analytical identification is meant representation of the function of many variables defined on finite range spaces by a general bracket formula on the basis of arbitrary binary operations. Described was a formula generation procedure based on calculation of binary operations, order of occurrence of variables, and places of bracket arrangement. Estimates of formula complexities were presented.