On One Computer's Graph-Model: Characteteristics + Optimisation + Application + Estimation

The formal model of virtual lingustic processors is presented. Theory of graphs is used to create the model. Some characteristics of the model are discribed, optimising transformations concerning the work of the phase of a selection of instructions for multilevel computers are introduced. The transformations are connected with macrooperations of the 'compression' and 'discompression (extention)' on the phase of the selection of computer's instructions. The model is used for the work optimization of a block for a selection of virtual linguistic processor's instructions on the base of a computer with the entrance language Refal as an example. Analysis and estimations are given for the one-level and multileveled realization of the block on program, microprogram and hardwires levels.