Entropy of pebble automata and space complexity
Formal Languages and Automata Theory
2026-05-12 v1 Computational Complexity
Abstract
Let L denote the class Logpsace and NL the class NLogspace. We use logCFL to denote the closure under logspace reductions of the set of context-free languages. We prove that NL is different from logCFL. This result implies L different from Ptime and the stronger separation NL different from Ptime.
Keywords
Cite
@article{arxiv.2605.08555,
title = {Entropy of pebble automata and space complexity},
author = {J. Andres Montoya},
journal= {arXiv preprint arXiv:2605.08555},
year = {2026}
}