On the public citation graph

Computing the counting function of context-free languages

https://doi.org/10.1007/bfb0039604
0 signed · 23 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.
Claim with ORCID
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.
See reference health

What this work says

Outgoing claims: the papers this work cites, builds on, or argues with.

inferredcites →https://doi.org/10.1007/978-1-4612-6264-0openalex-snapshot
Automata-Theoretic Aspects of Formal Power Series
inferredcites →https://doi.org/10.1016/0304-3975(79)90044-6openalex-snapshot
The Complexity of Computing the Permanent
inferredcites →https://doi.org/10.1016/0304-3975(84)90116-6openalex-snapshot
Algebraic languages and polyominoes enumeration
inferredcites →https://doi.org/10.1016/s0019-9958(85)80004-8openalex-snapshot
Sparse sets in NP-P: EXPTIME versus NEXPTIME
inferredcites →https://doi.org/10.1016/s0019-9958(85)80041-3openalex-snapshot
A taxonomy of problems with fast parallel algorithms
inferredcites →https://doi.org/10.1016/s0049-237x(08)72023-8openalex-snapshot
The Algebraic Theory of Context-Free Languages
inferredcites →https://doi.org/10.1090/psapm/019/0235938openalex-snapshot
Context-free languages and Turing machine computations
inferredcites →https://doi.org/10.1109/sfcs.1979.29openalex-snapshot
On simultaneous resource bounds
inferredcites →https://doi.org/10.1109/sfcs.1983.29openalex-snapshot
Logarithmic depth circuits for algebraic functions
inferredcites →https://doi.org/10.1137/0206054openalex-snapshot
On Relating Time and Space to Size and Depth
inferredcites →https://doi.org/10.1145/800076.802470openalex-snapshot
A characterization of the class of functions computable in polynomial time on Random Access Machines
inferredcites →https://doi.org/10.4171/lemopenalex-snapshot
L’Enseignement Mathématique

What points at this work

Incoming claims: where this work appears in other papers’ reference lists and arguments.

inferred← citeshttps://doi.org/10.1007/3-540-55808-x_3openalex-snapshot
Parallel recognition and ranking of context-free languages
inferred← citeshttps://doi.org/10.1007/978-1-4612-4478-3_9openalex-snapshot
The Power of Counting
inferred← citeshttps://doi.org/10.1007/bf02090763openalex-snapshot
The complexity of ranking simple languages
inferred← citeshttps://doi.org/10.1016/0020-0190(90)90089-gopenalex-snapshot
Counting problems and algebraic formal power series in noncommuting variables
inferred← citeshttps://doi.org/10.1016/0022-0000(90)90038-mopenalex-snapshot
On the complexity of ranking
inferred← citeshttps://doi.org/10.1016/0304-3975(93)90252-oopenalex-snapshot
A very hard log-space counting class
inferred← citeshttps://doi.org/10.1016/0890-5401(91)90060-fopenalex-snapshot
Effective entropies and data compression
inferred← citeshttps://doi.org/10.1051/ita:2006018openalex-snapshot
Preface
inferred← citeshttps://doi.org/10.1109/sct.1988.5280openalex-snapshot
The complexity of ranking
inferred← citeshttps://doi.org/10.1109/sct.1990.113964openalex-snapshot
A very hard log space counting class
inferred← citeshttps://doi.org/10.1137/0220034openalex-snapshot
Compression and Ranking
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.