On the public citation graph
Non-prinicipalité du cylindre des langages à compteur
0 signed · 32 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_2openalex-snapshot
Le cylindre des langages lineaires n'est pas principal
inferredcites →https://doi.org/10.1007/bf00264030openalex-snapshot
Sur diverses familles de langages ferm�es par transduction rationnelle
inferredcites →https://doi.org/10.1007/bf01694011openalex-snapshot
Counter machines and counter languages
inferredcites →https://doi.org/10.1016/0020-0271(67)90007-1openalex-snapshot
The mathematical theory of context-free languages
inferredcites →https://doi.org/10.1016/0304-3975(76)90004-9openalex-snapshot
Some uniformly erasable families of languages
inferredcites →https://doi.org/10.1016/s0019-9958(62)90244-9openalex-snapshot
Finite counting automata
inferredcites →https://doi.org/10.1016/s0022-0000(73)80036-4openalex-snapshot
Two iteration theorems for some families of languages
inferredcites →https://doi.org/10.1090/memo/0087openalex-snapshot
Studies in abstract families of languages
inferredcites →https://doi.org/10.1137/0203009openalex-snapshot
Jump PDA’s and Hierarchies of Deterministic Context-Free Languages
inferredcites →https://doi.org/10.5802/aif.287openalex-snapshot
Transductions des langages de Chomsky
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-08138-0_13openalex-snapshot
Cylindres de langages simples et pseudo-simples
inferred← citeshttps://doi.org/10.1007/3-540-09118-1_18openalex-snapshot
On zerotesting-bounded multicounter machines
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-10003-2_64openalex-snapshot
Derivations et reductions dans les grammaires algebrioues
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/bf00267045openalex-snapshot
The family of one-counter languages is closed under quotient
inferred← citeshttps://doi.org/10.1007/bf00288970openalex-snapshot
Formes de langages et de grammaires
inferred← citeshttps://doi.org/10.1007/bf00289070openalex-snapshot
Op�rations de cylindre et applications s�quentielles gauches inverses
inferred← citeshttps://doi.org/10.1007/bfb0017296openalex-snapshot
Quelques proprietes des langages a un Compteur
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.1080/00207168408803437openalex-snapshot
On characterisation of language families in terms of inverse morphisms
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.