All possible 3-tuples of 0 and 1:

The first element given is always picked first:

All ways of picking one element from each list:

Each occurrence of an element is picked separately:

All possible 2×2 arrays formed from a and b:

Tuples with any head:

Digits of successive base-2 numbers:

All possible trigrams of A and B:

Plot all possible 2×2 matrices of 0 and 1:

Neighborhood rules for an elementary cellular automaton:

Digit sequences, or evolution of a substitution system:

2D lattice of points:

Connect pairs of points in all possible ways:

All possible CirclePlus pairs that can be formed with three symbols:

Tuples[list,n] is equivalent to Tuples[Table[list,n]]:

All possible digit sequences:

Results from Outer involve extra sublists:

Subsets picks each element at most once, and treats reorderings as equivalent:

With one argument, Tuples picks an element from each sublist:

With two arguments, Tuples treats each sublist as a complete element:

Plot the accumulation of an equal number of 1s and s, first having mostly 1s and then mostly s:

3D lattice of points:

Show 50 of the 256 possible subsets of cuboids of the 2×2×2 arrangement shown in the first place:

Plot all 128 possible 7-tuples formed with 0 and 1:

3D lattice of spheres:

Draw all lines connecting the vertices of a polygon of n sides: