Logspace and logtime leaf languages

Finite Automata with Generalized Acceptance Criteria

ICAL '99 Proceedings of the 26th International Colloquium on Automata, Languages and Programming

A reducibility for the dot-depth hierarchy

Theoretical Computer Science - Mathematical foundations of computer science 2004

Complexity theory made easy: the formal language approach to the definition of complexity classes

DLT'03 Proceedings of the 7th international conference on Developments in language theory

Leaf languages and string compression

Information and Computation

On small hard leaf languages

MFCS'05 Proceedings of the 30th international conference on Mathematical Foundations of Computer Science

Leaf language classes

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