The theoretical aspects of count in the modified Fibonacci numerical system are proposed in the article. It allows constructing of high-speed Fibonacci counters where the hardware costs are comparatively small and increase proportionally at code length growth. Fibonacci transformations of codes are described that play the role of carryings and borrowings at increment and reverse count. The admissible forms of codes for specifying the initial states of counters are explored.
In this paper considers methodological approach was developed for analysis of parallel processes. This approach considers influence of structural hierarchy in dynamics, in other words it tracks processes of spatial areas transformation of correlated and generation of uncorrelated in time elements of generated network, at the time of transition of the network from one stable stage to another.