Succinct circuit representations and leaf language classes are basically the same concept. - Borchert, Bernd
Keywords: Computational complexity; Leaf language classes; Succint representations; Polynomial-time many-one completeness