On the public citation graph
Ambiguity and transcendence
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/978-1-4612-6264-0openalex-snapshot
Automata-Theoretic Aspects of Formal Power Series
inferredcites →https://doi.org/10.1007/978-1-4613-9595-9openalex-snapshot
An Introduction to Formal Language Theory
inferredcites →https://doi.org/10.1007/978-3-642-94694-3openalex-snapshot
Einführung in die Transzendenten Zahlen
inferredcites →https://doi.org/10.1007/bf00264258openalex-snapshot
A note on the density of inherently ambiguous context-free languages
inferredcites →https://doi.org/10.1016/0012-365x(82)90123-6openalex-snapshot
On the number of words in the language {w ε σ∗ ∣ w = wR}2
inferredcites →https://doi.org/10.1016/0016-0032(58)90688-4openalex-snapshot
An introduction to probability theory and its applications
inferredcites →https://doi.org/10.1016/0096-0551(80)90068-5openalex-snapshot
Introduction to formal language theory
inferredcites →https://doi.org/10.1016/s0019-9958(71)90455-4openalex-snapshot
Some inherently ambiguous context-free languages
inferredcites →https://doi.org/10.1016/s0049-237x(08)72023-8openalex-snapshot
The Algebraic Theory of Context-Free Languages
inferredcites →https://doi.org/10.1109/sfcs.1976.19openalex-snapshot
Lower bounds from complex function theory
inferredcites →https://doi.org/10.1109/sfcs.1979.11openalex-snapshot
Computational complexity in algebraic function fields
inferredcites →https://doi.org/10.1145/800061.808735openalex-snapshot
Lower bounds for algebraic computation trees
inferredcites →https://doi.org/10.2307/2317365openalex-snapshot
Elements of the Theory of Algebraic Curves.
inferredcites →https://doi.org/10.2307/2980979openalex-snapshot
An Introduction to Probability Theory and its Applications.
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-16078-7_74openalex-snapshot
On sparseness, ambiguity and other decision problems for acceptors and transducers
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-319-23021-4_4openalex-snapshot
Why We Need Semirings in Automata Theory (Extended Abstract)
inferred← citeshttps://doi.org/10.1007/978-3-319-60134-2_15openalex-snapshot
On the Conjecture $$\mathcal {L}_{\mathsf {DFCM}}\subsetneq \mathsf {RCM}$$
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/bfb0028790openalex-snapshot
On formal languages, probabilities, paging and decoding algorithms
inferred← citeshttps://doi.org/10.1007/bfb0028797openalex-snapshot
Elements of a general theory of combinatorial structures
inferred← citeshttps://doi.org/10.1007/bfb0028971openalex-snapshot
Properties of infinite words : Recent results
inferred← citeshttps://doi.org/10.1007/bfb0030299openalex-snapshot
Computability of probabilistic parameters for some classes of formal languages
inferred← citeshttps://doi.org/10.1007/bfb0072506openalex-snapshot
Prefix-free words of length N over M letters : two-sided well-balanced parentheses and palindroms
inferred← citeshttps://doi.org/10.1007/pl00009230openalex-snapshot
Philippe Flajolet's Research in Analysis of Algorithms and Combinatorics
inferred← citeshttps://doi.org/10.1016/0020-0190(87)90162-1openalex-snapshot
Prefixes of infinite words and ambiguous context-free languages
inferred← citeshttps://doi.org/10.1016/0304-3975(91)90172-xopenalex-snapshot
On the number of factors of Sturmian words
inferred← citeshttps://doi.org/10.1016/b978-0-444-88074-1.50007-xopenalex-snapshot
Context-Free Languages
inferred← citeshttps://doi.org/10.1016/b978-0-444-88074-1.50008-1openalex-snapshot
Formal Languages and Power Series
inferred← citeshttps://doi.org/10.1016/j.tcs.2016.07.022openalex-snapshot
On a class of languages with holonomic generating functions
inferred← citeshttps://doi.org/10.1016/s0304-3975(02)00584-4openalex-snapshot
Ambiguity in omega context free languages
inferred← citeshttps://doi.org/10.1016/s0895-7177(97)00199-4openalex-snapshot
The number of three-choice polygons
inferred← citeshttps://doi.org/10.1051/ita/1989230404451openalex-snapshot
Non recursive functions have transcendental generating series
inferred← citeshttps://doi.org/10.1090/dimacs/024/04openalex-snapshot
Algebraic languages: A bridge between combinatorics and computer science
inferred← citeshttps://doi.org/10.3233/fi-2011-532openalex-snapshot
On Approximating Non-regular Languages by Regular Languages
inferred← citeshttps://doi.org/10.5555/56123.56125openalex-snapshot
Complexity measures and cellular automata
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.