Rearrangeable Finite Automata Assembled of Universal Modules

Ways to construct and diagrams of universal flip-flop memory elements (modules) are proposed for rearrangeable finite automata as is an algorithm for assembly of automata from flip-flop and logical modules. Complexity estimates are obtained for the resultant curcuits.