Entropy of pebble automata and space complexity
Fuente:
arXiv
Saved in:
| Main Author: | |
|---|---|
| Format: | Preprint |
| Published: |
2026
|
| Subjects: | |
| Online Access: | |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| _version_ | 1866915996041740288 |
|---|---|
| author | Montoya, J. Andres |
| author_facet | Montoya, J. Andres |
| contents | 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. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2605_08555 |
| institution | arXiv |
| publishDate | 2026 |
| record_format | arxiv |
| spellingShingle | Entropy of pebble automata and space complexity Montoya, J. Andres Formal Languages and Automata Theory Computational Complexity 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. |
| title | Entropy of pebble automata and space complexity |
| topic | Formal Languages and Automata Theory Computational Complexity |
| url | https://arxiv.org/abs/2605.08555 |