Skip to search formSkip to main contentSkip to account menu

Leaf language

In computational complexity theory, a leaf language is a method of characterizing a complexity class by formalizing what it means for a machine to… 
Wikipedia (opens in a new tab)

Related topics

Related topics

3 relations
Complexity classComputational complexity theoryFormal language

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
2007
2007
On Balanced vs . Unbalanced Computation Trees
A great number of complexity classes between P and PSPACE can be deened via leaf languages for computation trees of… 
2005
2005
On Small Hard Leaf Languages
This paper deals with balanced leaf language complexity classes, introduced independently in [1] and [14]. We propose the seed… 
Review
2005
Review
2005
Leaf language classes : A survey
The theory of leaf language classes is a fruitful field of research which has been developed since the beginning of the nineties… 
1999
1999
Generalized Regular Counting Classes
Complexity classes, which are defined via finite commutative monoids, can be considered as (very) regular counting classes. These… 
1997
1997
A Characterization of the Leaf Language Classes
1996
1996
Nondeterministic NC/sup 1/ computation
We define the counting classes NC/sup 1/, GapNC/sup 1/ PNC/sup 1/ and C/sub =/NC/sup 1/. We prove that Boolean circuits… 
1995
1995
Succinct Representation and Leaf Languages
  • H. Veith
  • Electron. Colloquium Comput. Complex.
  • 1995
  • Corpus ID: 17941495
In this paper, we present stronger results in the theory of succinct problem representation and establish a close relationship… 
1995
1995
Regular Leaf Languages and (non-) Regular Tree Shapes
We investigate the power of regular leaf languages with respect to three diierent tree shapes: the rst one is the case of… 
Review
1994
Review
1994
Complexity classes defined via k-valued functions
  • U. Hertrampf
  • Proceedings of IEEE 9th Annual Conference on…
  • 1994
  • Corpus ID: 3091755
A lot of complexity classes can be characterized by posing some global acceptance condition on the computation trees produced by… 
1992
1992
On the Power of Polynomial Bit-Reductions
We examine the notion of deenability of complexity classes via leaf languages, introduced a nondeterministic polynomial time… 
By clicking accept or continuing to use the site, you agree to the terms outlined in our Privacy Policy (opens in a new tab), Terms of Service (opens in a new tab), and Dataset License (opens in a new tab)