“…I S / of k-valued and countably-infinite-valued functions with superposition operations (k-valued and countably-infinite-valued logics); the algebra .P BD I S; F / of boundedly determinate functions with superposition and feedback operations (finite automata); the algebra .P par:r I S; PR; M / of partial recursive (computable) functions with superposition, primitive recursion, and minimisation operations [1][2][3][4]. Also the following kinds of function algebras are studied: the algebra of partial k-valued functions [5][6][7][8][9][10], the algebras of functions whose domain is the Cartesian product of finite sets [11][12][13][14][15][16][17], the algebras of mappings whose domain and range are distinct [1,2,[18][19][20][21], the algebra of mappings of regular sets of a certain finite alphabet words [22]; the algebra of special sets, so-called bundles, of functions [23,24]; the algebras with various definitions of closure operators [1,2,[25][26][27][28][29][30]; the algebras with operations similar to algorithms and programs [31][32][33][34][35][36][37][38]; the alge...…”