Remarks on systems, beads, and bead sets

Abstract

Beads are a particular class of binary sequences with interesting properties due to which they can be related to Binary decision diagrams. Recently, the concept of beads was extended to integer sequences and sequences over finite fields and used in the classification of logic functions in terms of decision diagrams. In this paper, sets of beads and integer beads are used to estimate the equality of structure of digital systems implementing logic functions.