𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Leaf languages and string compression

✍ Scribed by Markus Lohrey

Book ID
113641976
Publisher
Elsevier Science
Year
2011
Tongue
English
Weight
400 KB
Volume
209
Category
Article
ISSN
0890-5401

No coin nor oath required. For personal study only.

πŸ“œ SIMILAR VOLUMES

Logspace and Logtime Leaf Languages
Logspace and Logtime Leaf Languages
✍ Birgit Jenner; Pierre McKenzie; Denis ThΓ©rien πŸ“‚ Article πŸ“… 1996 πŸ› Elsevier Science 🌐 English βš– 611 KB
Generic separations and leaf languages
Generic separations and leaf languages
✍ Matthias Galota; Sven Kosub; Heribert Vollmer πŸ“‚ Article πŸ“… 2003 πŸ› John Wiley and Sons 🌐 English βš– 167 KB

## Abstract In the early nineties of the previous century, leaf languages were introduced as a means for the uniform characterization of many complexity classes, mainly in the range between P (polynomial time) and PSPACE (polynomial space). It was shown that the separability of two complexity class