A design procedure is presented for realizing multiple-valued sequential logic functions as tree structured networks of sequential universal logic modules (SULM's). Both definite and nondefinite finite state machines can be realized using this approach. The SULM employed is a multiple-valued multiplexer-flip-flop cascade that can be efficiently implemented in multiple-valued technologies.