Abstract:
Random mappings $\sigma\colon X\to X$ of $n$-set $X$ with constraints on degrees of vertices in a directed graph $\Gamma(\sigma)$ are considered. Mappings corresponding to the binary shift register of length $l$ with a random feedback function are particular cases of this model.
Key words:random mappings with constraints, shift register, feedback function.