The paper studies ternary logic functions that have decision diagrams of identical shape. The concept of beads, a special class of binary sequences, is extended to ternary sequences and are used to describe the shape of the decision diagrams representing functions that are mathematical models of such sequences. We point out that establishing the links between beads, functions, and their decision diagram representations can be useful in classification of ternary functions, checking the equivalence of functions, as well as their circuit implementations.