On the public citation graph
Lower bounds on space complexity for contextfree recognition
0 signed · 37 inferred · view as graph
Inferred edges come from two machine sources: sweeps of open repository metadata (mostly SSRN and Zenodo), and a bulk OpenAlex citation snapshot. Every row below is labelled with the one it came from. Neither is a complete citation index — absence here is not evidence of absence.
Is this your work? Sign in with ORCID and put your name on the
claims that are yours.
Reference health. See whether every reference in this work resolves to a
known work and none has been retracted — and get a dated CiteStamped
badge you can embed.
What this work says
Outgoing claims: the papers this work cites, builds on, or argues with.
inferredcites →https://doi.org/10.1007/3-540-07407-4_15openalex-snapshot
About the deterministic simulation of nondeterministic (log n)-tape bounded turing machines
inferredcites →https://doi.org/10.1007/3-540-08138-0_10openalex-snapshot
Eine untere Schranke für den Platzbedarf bei der Analyse beschränkter kontextfreier Sprachen
inferredcites →https://doi.org/10.1016/0020-0190(76)90013-2openalex-snapshot
Bracket-languages are recognizable in logarithmic space
inferredcites →https://doi.org/10.1016/s0019-9958(67)90591-8openalex-snapshot
A regularity test for pushdown machines
inferredcites →https://doi.org/10.1016/s0019-9958(72)90205-7openalex-snapshot
Language recognition by marking automata
inferredcites →https://doi.org/10.1109/focs.1965.14openalex-snapshot
Memory bounds for recognition of context-free and context-sensitive languages
inferredcites →https://doi.org/10.1109/sfcs.1975.2openalex-snapshot
A note on tape bounds for sla language processing
inferredcites →https://doi.org/10.1109/swat.1973.20openalex-snapshot
On tape-bounded complexity classes and multi-head finite automata
inferredcites →https://doi.org/10.1145/322033.322037openalex-snapshot
Log Space Recognition and Translation of Parenthesis Languages
inferredcites →https://doi.org/10.1145/990502.990506openalex-snapshot
A language over a one symbol alphabet requiring only O (log log n) space
What points at this work
Incoming claims: where this work appears in other papers’ reference lists and arguments.
inferred← citeshttps://doi.org/10.1002/rsa.20637openalex-snapshot
A combinatorial characterization of smooth LTCs and applications
inferred← citeshttps://doi.org/10.1007/3-540-08342-1_23openalex-snapshot
Complexity of some problems concerning L systems
inferred← citeshttps://doi.org/10.1007/3-540-56503-5_4openalex-snapshot
Separating the lower levels of the sublogarithmic space hierarchy
inferred← citeshttps://doi.org/10.1007/978-1-4612-1872-2_9openalex-snapshot
Computing with Sublogarithmic Space
inferred← citeshttps://doi.org/10.1007/bf01699458openalex-snapshot
On efficient deterministic simulation of turing machine computations below logaspace
inferred← citeshttps://doi.org/10.1007/bf01744286openalex-snapshot
Complexity of some problems concerningL systems
inferred← citeshttps://doi.org/10.1007/bf01752401openalex-snapshot
Sur une propriété d'itération des langages algébriques déterministes
inferred← citeshttps://doi.org/10.1007/bf02088003openalex-snapshot
Sublogarithmic-space turing machines, nonuniform space complexity, and closure properties
inferred← citeshttps://doi.org/10.1016/0020-0190(76)90013-2openalex-snapshot
Bracket-languages are recognizable in logarithmic space
inferred← citeshttps://doi.org/10.1016/0020-0190(87)90085-8openalex-snapshot
Some observations concerning alternating turing machines using small space
inferred← citeshttps://doi.org/10.1016/0020-0190(92)90127-hopenalex-snapshot
A lower bound for the nondeterministic space complexity of context-free recognition
inferred← citeshttps://doi.org/10.1016/0020-0190(92)90205-aopenalex-snapshot
A relationship between nondeterministic Turing machines and 1-inkdot turing machines with small space
inferred← citeshttps://doi.org/10.1016/0304-3975(82)90075-5openalex-snapshot
On eliminating nondeterminism from turing machines which use less than logarithm worktape space
inferred← citeshttps://doi.org/10.1016/0304-3975(83)90078-6openalex-snapshot
Bandwidth constraints on problems complete for polynomial time
inferred← citeshttps://doi.org/10.1016/0304-3975(91)90054-6openalex-snapshot
An NP-complete language accepted in linear time by a one-tape Turing machine
inferred← citeshttps://doi.org/10.1016/0304-3975(92)90151-5openalex-snapshot
A survey of space complexity
inferred← citeshttps://doi.org/10.1016/0890-5401(87)90057-5openalex-snapshot
On the Monte Carlo space constructible functions and separation results for probabilistic complexity classes
inferred← citeshttps://doi.org/10.1016/0890-5401(91)90061-6openalex-snapshot
Some classes of languages in NC1
inferred← citeshttps://doi.org/10.1016/b978-0-12-389450-2.50014-1openalex-snapshot
Time and Space††This research was supported in part under N S F grant GJ 43634X, contract number DCR 7412997 A01.
inferred← citeshttps://doi.org/10.1016/j.ic.2007.07.001openalex-snapshot
Magic numbers in the state hierarchy of finite automata
inferred← citeshttps://doi.org/10.1109/sct.1994.315816openalex-snapshot
The complexity world below logarithmic space
inferred← citeshttps://doi.org/10.1137/s0097539793252444openalex-snapshot
The Sublogarithmic Alternating Space World
inferred← citeshttps://doi.org/10.22028/d291-26085openalex-snapshot
Complexity arguments in algebraic language theory
inferred← citeshttps://doi.org/10.48550/arxiv.1503.05670openalex-snapshot
Time and Space Efficient Algorithms for RNA Folding with the Four-Russians Technique
inferred← citeshttps://doi.org/10.7146/dpb.v5i67.6485openalex-snapshot
Complexity of some Problems Concerning L Systems. (Preliminary report)
Editorial review for independent work. ICSAC — the Institute for Complexity
Science and Advanced Computing — runs a structured editorial panel for researchers
publishing outside journals, and publishes on CiteStamp rails. Submission is free
and goes through ORCID: icsacinstitute.org/submit.