On the construction of parallel computers from various bases of Boolean functions
Theoretical Computer Science
Structural complexity 1
Structural complexity 2
A uniform approach to define complexity classes
Theoretical Computer Science
Complexity classes and sparse oracles
Journal of Computer and System Sciences
Logspace and logtime leaf languages
Information and Computation
Succinct circuit representations and leaf language classes are basically the same concept
Information Processing Letters
Handbook of formal languages, vol. 1
Unambiguous computations and locally definable acceptance types
Theoretical Computer Science
A characterization of the leaf language classes
Information Processing Letters
Relating polynomial time to constant depth
Theoretical Computer Science - Special issue In Memoriam of Ronald V. Book
Nondeterministic NC1 computation
Journal of Computer and System Sciences - Eleventh annual conference on structure and complexity 1996
Uniform characterizations of complexity classes
ACM SIGACT News
Theoretical Computer Science
Locally Definable Acceptance Types - The Three-Valued Case
LATIN '92 Proceedings of the 1st Latin American Symposium on Theoretical Informatics
Locally Definable Acceptance Types for Polynomial Time Machines
STACS '92 Proceedings of the 9th Annual Symposium on Theoretical Aspects of Computer Science
On the Acceptance Power of Regular Languages
STACS '94 Proceedings of the 11th Annual Symposium on Theoretical Aspects of Computer Science
Complexity Classes with Finite Acceptance Types
STACS '94 Proceedings of the 11th Annual Symposium on Theoretical Aspects of Computer Science
A Generalization of the Büchi-Elgot-Trakhtenbrot Theorem
CSL '01 Proceedings of the 15th International Workshop on Computer Science Logic
Relating Automata-Theoretic Hierarchies to Complexity-Theoretic Hierarchies
FCT '01 Proceedings of the 13th International Symposium on Fundamentals of Computation Theory
On NP-Partitions over Posets with an Application to Reducing the Set of Solutions of NP Problems
MFCS '00 Proceedings of the 25th International Symposium on Mathematical Foundations of Computer Science
Succinct Representation, Leaf Languages, and Projection Reductions
CCC '96 Proceedings of the 11th Annual IEEE Conference on Computational Complexity
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
The dot-depth and the polynomial hierarchy correspond on the delta levels
DLT'04 Proceedings of the 8th international conference on Developments in Language Theory
Autoreducibility, mitoticity, and immunity
Journal of Computer and System Sciences
Fine hierarchies and m-reducibilities in theoretical computer science
Theoretical Computer Science
Machines that can output empty words
MFCS'06 Proceedings of the 31st international conference on Mathematical Foundations of Computer Science
Perfect correspondences between dot-depth and polynomial-time hierarchy
DLT'06 Proceedings of the 10th international conference on Developments in Language Theory
Some reducibilities on regular sets
CiE'05 Proceedings of the First international conference on Computability in Europe: new Computational Paradigms
| Hi-index | 0.00 |
The theory of leaf language classes is a fruitful field of research which has been developed since the beginning of the nineties. The leaf language model, in which one language (or a pair of languages) defines a class of languages, allows a uniform definition and treatment of many complexity classes. The results of this area give new insights into the structure of complexity classes and their relation to other fields of Theoretical Computer Science.