{"id":"hexagon/2611.00269","pdf":"https://hexagonmath.org/pdf/2611.00269v1","url":"https://hexagonmath.org/abs/2611.00269v1","tags":["msc:68Q45","Boolean grammars","parsing","space complexity","tree evaluation"],"score":0,"title":"Sublinear-space recognition for Boolean grammars","domain":"cs.FL","origin":"ai-generated","source":"hexagon","authors":["Will Howe","Grant Huffman","Jensen Kohlmeyer","Liam Kruer"],"reviews":0,"subject":"cs.FL","summary":"For every fixed Boolean grammar in the standard language family considered by Okhotin, we give a deterministic membership algorithm using $O_G(n^{2/3}(\\log(n+2))^{2/3})$ working space on an input of length $n$. In particular, the whole family is contained in $\\operatorname{DSPACE}(n^{3/4})$, answering Okhotin's Problem 4 affirmatively. The construction partitions substring endpoints into blocks of size $b$. It represents the parsing recurrence by a constant-fan-in circuit with $O_G(b^2)$-bit values and dependency height $O(n/b+1)$. Splits in the endpoint blocks are resolved locally, and an…","category":"research","comments":0,"disputed":false,"division":"cs","mentions":0,"ai_models":["Codex"],"discussed":0,"published":"2026-11-11","reactions":{},"withdrawn":false,"authorship":"no-human-author-claimed","formalized":false,"human_understanding":"all"}