On the public citation graph

A note on the density of inherently ambiguous context-free languages

https://doi.org/10.1007/bf00264258
0 signed · 18 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-3-642-94694-3openalex-snapshot
Einführung in die Transzendenten Zahlen
inferredcites →https://doi.org/10.1007/978-3-662-21545-6openalex-snapshot
Automata, Languages and Programming
inferredcites →https://doi.org/10.1016/s0019-9958(70)90105-1openalex-snapshot
On the entropy of context-free languages
inferredcites →https://doi.org/10.1090/s0002-9904-1926-04222-1openalex-snapshot
Note on a theorem of Kempner concerning transcendental numbers

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-44612-5_64openalex-snapshot
Sublinear Ambiguity
inferred← citeshttps://doi.org/10.1007/978-3-030-67731-2_6openalex-snapshot
Asymptotic Approximation by Regular Languages
inferred← citeshttps://doi.org/10.1007/978-3-642-59136-5_9openalex-snapshot
Semirings and Formal Power Series: Their Relevance to Formal Languages and Automata
inferred← citeshttps://doi.org/10.1007/bfb0015743openalex-snapshot
Ambiguity and transcendence
inferred← citeshttps://doi.org/10.1016/0012-365x(82)90123-6openalex-snapshot
On the number of words in the language {w ε σ∗ ∣ w = wR}2
inferred← citeshttps://doi.org/10.1016/0304-3975(87)90011-9openalex-snapshot
Analytic models and ambiguity of context-free languages
inferred← citeshttps://doi.org/10.1016/j.tcs.2005.04.012openalex-snapshot
The scientific works of Rainer Kemp (1949–2004)
inferred← citeshttps://doi.org/10.1016/s0019-9958(81)90634-3openalex-snapshot
The characterization of nonexpansive grammars by rational power series
inferred← citeshttps://doi.org/10.1017/s0963548314000728openalex-snapshot
Formulae and Asymptotics for Coefficients of Algebraic Functions
inferred← citeshttps://doi.org/10.1088/0951-7715/4/3/006openalex-snapshot
Generalized one-sided shifts and maps of the interval
inferred← citeshttps://doi.org/10.46298/dmtcs.2366openalex-snapshot
Coefficients of algebraic functions: formulae and asymptotics
inferred← citeshttps://doi.org/10.46298/dmtcs.3471openalex-snapshot
Undecidable problems concerning densities of languages
inferred← citeshttps://doi.org/10.48550/arxiv.2008.01413openalex-snapshot
Asymptotic Approximation by Regular Languages
inferred← citeshttps://doi.org/10.5802/jtnb.1135openalex-snapshot
The upper density of an automatic set is rational
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.