On the public citation graph

Centers of languages

0 signed · 17 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/bf01768473openalex-snapshot
Le cylindre des langages linéaires
inferredcites →https://doi.org/10.1016/0022-0000(80)90010-0openalex-snapshot
Adherences of languages
inferredcites →https://doi.org/10.1016/b978-0-12-115350-2.50018-xopenalex-snapshot
APPLICATION OF FORMAL LANGUAGE THEORY TO PROBLEMS OF SECURITY AND SYNCHRONIZATION11Preparation of this paper was supported in part by the National Science Foundation under Grant No. MCS79–04012.
inferredcites →https://doi.org/10.1016/s0022-0000(69)80011-5openalex-snapshot
Parallel program schemata
inferredcites →https://doi.org/10.1051/ita/1978120302591openalex-snapshot
Sur les ensembles de mots infinis engendrés par une grammaire algébrique
inferredcites →https://doi.org/10.1051/ita/1979130302031openalex-snapshot
Un langage algébrique particulier

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-50580-6_26openalex-snapshot
A survey on the decidability questions for classes of fifo nets
inferred← citeshttps://doi.org/10.1007/3-540-54152-7_59openalex-snapshot
Acceptance Automata: A framework for specifying and verifying TCSP parallel systems
inferred← citeshttps://doi.org/10.1007/bf00289241openalex-snapshot
Bicentres de langages alg�briques
inferred← citeshttps://doi.org/10.1007/bfb0016286openalex-snapshot
The centers of context-sensitive languages
inferred← citeshttps://doi.org/10.1016/0304-3975(83)90128-7openalex-snapshot
On the centers of a language
inferred← citeshttps://doi.org/10.1016/0304-3975(86)90166-0openalex-snapshot
Infinite-word languages and continuous mappings
inferred← citeshttps://doi.org/10.1016/0304-3975(91)90158-xopenalex-snapshot
Generalized automata on infinite trees and Muller-McNaughton's Theorem
inferred← citeshttps://doi.org/10.1016/s0304-3975(02)00006-3openalex-snapshot
Nivat's processes and their synchronization
inferred← citeshttps://doi.org/10.1051/ita/1982160403171openalex-snapshot
Une application des notions de centre et index rationnel à certains langages algébriques
inferred← citeshttps://doi.org/10.1051/ita/2024002openalex-snapshot
Topologies for Finite Words: Compatibility with the Cantor Topology
inferred← citeshttps://doi.org/10.1145/773153.773165openalex-snapshot
Query containment and rewriting using views for regular path queries under constraints
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.