Succinct circuit representations and leaf language classes are basically the same concept

On the complexity of data disjunctions

Theoretical Computer Science - Complexity and logic

A Generalized Quantifier Concept in Computational Complexity Theory

ESSLLI '97 Revised Lectures from the 9th European Summer School on Logic, Language, and Information: Generalized Quantifiers and Computation

Leaf languages and string compression

Information and Computation

Model-checking hierarchical structures

Journal of Computer and System Sciences

Leaf language classes

MCU'04 Proceedings of the 4th international conference on Machines, Computations, and Universality