Weizmann Logo
Electronic Colloquium on Computational Complexity

Under the auspices of the Computational Complexity Foundation (CCF)

Login | Register | Classic Style

All reports by Author Pilar Albert:

TR07-051 | 18th April 2007
Pilar Albert, Elvira Mayordomo, Philippe Moser

Bounded Pushdown dimension vs Lempel Ziv information density

In this paper we introduce a variant of pushdown dimension called bounded pushdown (BPD) dimension, that measures the density of information contained in a sequence, relative to a BPD automata, i.e. a finite state machine equipped with an extra infinite memory stack, with the additional requirement that every input symbol ... more >>>

ISSN 1433-8092 | Imprint