Fig. 2

Tree directed graph of the universal decoder for four variables. Each rank j (j=0,…,n−1) consists of 2j blocks, and each block realizes 2(n−j) conjunctive terms with j+1 letters (input variables)