On the public citation graph

Une extension aux mots infinis de la notion de transduction rationnelle

https://doi.org/10.1007/bfb0036475
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/bf00288769openalex-snapshot
Sur les g�n�rateurs alg�briques et lin�aires
inferredcites →https://doi.org/10.1016/0022-0000(80)90010-0openalex-snapshot
Adherences of languages
inferredcites →https://doi.org/10.1051/ita/1979130302031openalex-snapshot
Un langage algébrique particulier
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/11672142_24openalex-snapshot
On the Accepting Power of 2-Tape Büchi Automata
inferred← citeshttps://doi.org/10.1007/3-540-12689-9_127openalex-snapshot
Metrical and ordered properties of powerdomains
inferred← citeshttps://doi.org/10.1007/3-540-45066-1_12openalex-snapshot
On Infinitary Rational Relations and Borel Sets
inferred← citeshttps://doi.org/10.1007/bfb0029636openalex-snapshot
Rational ω-transductions
inferred← citeshttps://doi.org/10.1016/0304-3975(90)90018-dopenalex-snapshot
The three subfamilies of rational ω-languages closed under ω-transduction
inferred← citeshttps://doi.org/10.1016/s0304-3975(99)00115-2openalex-snapshot
How to decide continuity of rational functions on infinite words
inferred← citeshttps://doi.org/10.1051/ita/2009001openalex-snapshot
Highly Undecidable Problems For Infinite Computations
inferred← citeshttps://doi.org/10.1051/ita:2003013openalex-snapshot
Undecidability of Topological and Arithmetical Properties of Infinitary Rational Relations
inferred← citeshttps://doi.org/10.1051/ita:2003016openalex-snapshot
On the Topological Complexity of Infinitary Rational Relations
inferred← citeshttps://doi.org/10.1051/ita:2007050openalex-snapshot
On the continuity set of an Omega rational function
inferred← citeshttps://doi.org/10.1080/00207169208804080openalex-snapshot
Closure properties of subclasses of ω-regular languages under morphism and inverse morphism
inferred← citeshttps://doi.org/10.1080/00207169208804118openalex-snapshot
Closure properties of subclasses of ω-regular languages under morphism and inverse morphism
inferred← citeshttps://doi.org/10.48550/arxiv.0801.3912openalex-snapshot
On the Continuity Set of an omega Rational Function
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.