On the public citation graph

Le cylindre des langages linéaires

https://doi.org/10.1007/bf01768473
0 signed · 27 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/bf00264030openalex-snapshot
Sur diverses familles de langages ferm�es par transduction rationnelle
inferredcites →https://doi.org/10.1007/bf01694004openalex-snapshot
A helpful result for proving inherent ambiguity
inferredcites →https://doi.org/10.1016/0304-3975(76)90033-5openalex-snapshot
Langages algebriques, paires iterantes et transductions rationnelles
inferredcites →https://doi.org/10.1016/s0022-0000(75)80038-9openalex-snapshot
Uniformly erasable AFL
inferredcites →https://doi.org/10.1137/0202025openalex-snapshot
The Hardest Context-Free Language
inferredcites →https://doi.org/10.1137/0203009openalex-snapshot
Jump PDA’s and Hierarchies of Deterministic Context-Free Languages
inferredcites →https://doi.org/10.1145/321312.321318openalex-snapshot
Ambiguity in context free languages
inferredcites →https://doi.org/10.1145/321906.321913openalex-snapshot
A Note on Tape-Bounded Complexity Classes and Linear Context-Free languages

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-08353-7_125openalex-snapshot
Classification of the context-free languages
inferred← citeshttps://doi.org/10.1007/3-540-08353-7_140openalex-snapshot
Pushdown-automata and families of languages generating cylinders
inferred← citeshttps://doi.org/10.1007/3-540-09526-8_18openalex-snapshot
Relationships between AFDL's and cylinders
inferred← citeshttps://doi.org/10.1007/3-540-12727-5_6openalex-snapshot
Prefix and perfect languages
inferred← citeshttps://doi.org/10.1007/978-3-030-68195-1_10openalex-snapshot
On Hardest Languages for One-Dimensional Cellular Automata
inferred← citeshttps://doi.org/10.1007/978-3-030-81508-0_25openalex-snapshot
The Hardest LL(k) Language
inferred← citeshttps://doi.org/10.1007/978-3-319-34171-2_24openalex-snapshot
The Hardest Language for Conjunctive Grammars
inferred← citeshttps://doi.org/10.1007/978-3-319-77313-1_3openalex-snapshot
Underlying Principles and Recurring Ideas of Formal Grammars
inferred← citeshttps://doi.org/10.1007/bf00289070openalex-snapshot
Op�rations de cylindre et applications s�quentielles gauches inverses
inferred← citeshttps://doi.org/10.1007/bfb0017316openalex-snapshot
Centers of languages
inferred← citeshttps://doi.org/10.1016/0022-0000(83)90032-6openalex-snapshot
Remarks on multihead pushdown automata and multihead stack automata
inferred← citeshttps://doi.org/10.1016/0304-3975(79)90015-xopenalex-snapshot
Generateurs algebriques et systemes de paires iterantes
inferred← citeshttps://doi.org/10.1016/b978-0-12-115350-2.50008-7openalex-snapshot
GENERATORS OF CONES AND CYLINDERS11Preparation of this paper was supported in part by the National Science Foundation under Grant No. MCS79-04012.
inferred← citeshttps://doi.org/10.1016/j.ic.2018.11.001openalex-snapshot
Hardest languages for conjunctive and Boolean grammars
inferred← citeshttps://doi.org/10.1016/j.ic.2022.104891openalex-snapshot
On hardest languages for one-dimensional cellular automata
inferred← citeshttps://doi.org/10.1016/j.tcs.2023.113829openalex-snapshot
The hardest language for grammars with context operators
inferred← citeshttps://doi.org/10.1051/ita/1979130403631openalex-snapshot
Quelques problèmes ouverts en théorie des langages algébriques
inferred← citeshttps://doi.org/10.1080/00207168408803437openalex-snapshot
On characterisation of language families in terms of inverse morphisms
inferred← citeshttps://doi.org/10.1142/s012905412344001xopenalex-snapshot
The Hardest LL(k) Language
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.