Karnaukh T. Function and number classes defined by transducers and generators

This work is devoted to the investigation of the computational models with different constraint (on memory type and/or output representation) with regard to their abilities to specify arithmetical functions, real numbers and real functions. Interconnections between classes of real functions, which are computable by strict R-transducer-reals, and real functions, described in terms of classical analysis, are established. In this work properties of grammars with memory, in particular with nonerasing stack memory, are investigated. Also nested stack generators for computing transcendental numbers are built. For continuous total real function necessary and sufficient conditions for its defining by strict R-transducer-real are obtained.