On the public citation graph
Relations rationnelles infinitaires
0 signed · 39 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.1016/s0019-9958(66)80013-xopenalex-snapshot
Testing and generating infinite sequences by a finite automaton
inferredcites →https://doi.org/10.1016/s0079-8169(08)x6055-6openalex-snapshot
Automata, Languages, and Machines
inferredcites →https://doi.org/10.1147/rd.91.0047openalex-snapshot
On Relations Defined by Generalized Finite Automata
inferredcites →https://doi.org/10.1515/9781400882618-002openalex-snapshot
Representation of Events in Nerve Nets and Finite Automata
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-45066-1_12openalex-snapshot
On Infinitary Rational Relations and Borel Sets
inferred← citeshttps://doi.org/10.1007/3-540-52282-4_49openalex-snapshot
Infinite trees and automaton definable relations over ω-words
inferred← citeshttps://doi.org/10.1007/978-3-030-40608-0_21openalex-snapshot
The Automatic Baire Property and an Effective Property of $$\omega $$-Rational Functions
inferred← citeshttps://doi.org/10.1007/978-3-642-60207-8_6openalex-snapshot
Uniformization of Rational Relations
inferred← citeshttps://doi.org/10.1007/978-3-662-47666-6_18openalex-snapshot
Incompleteness Theorems, Large Cardinals, and Automata over Infinite Words
inferred← citeshttps://doi.org/10.1007/bfb0013115openalex-snapshot
Automata and quantifier hierarchies
inferred← citeshttps://doi.org/10.1007/bfb0027043openalex-snapshot
Infinitary languages: Basic theory and applications to concurrent systems
inferred← citeshttps://doi.org/10.1007/s10626-009-0084-5openalex-snapshot
Prognosis of ω-Languages for the Diagnosis of *-Languages: A Topological Perspective
inferred← citeshttps://doi.org/10.1016/0020-0190(86)90058-xopenalex-snapshot
Two decidability problems for infinite words
inferred← citeshttps://doi.org/10.1016/0304-3975(83)90057-9openalex-snapshot
A note on ω-regular languages
inferred← citeshttps://doi.org/10.1016/0304-3975(86)90025-3openalex-snapshot
Two characterizations of rational adherences
inferred← citeshttps://doi.org/10.1016/0304-3975(87)90134-4openalex-snapshot
Semantique asynchrone et comportements infinis en CSP
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/0304-3975(91)90022-topenalex-snapshot
Langages algébriques de mots biinfinis
inferred← citeshttps://doi.org/10.1016/0304-3975(92)90090-3openalex-snapshot
Infinite trees and automaton- definable relations over ω-words
inferred← citeshttps://doi.org/10.1016/0304-3975(92)90249-fopenalex-snapshot
Confluent linear numeration systems
inferred← citeshttps://doi.org/10.1016/0304-3975(93)90230-qopenalex-snapshot
Synchronized rational relations of finite and infinite words
inferred← citeshttps://doi.org/10.1016/b978-0-444-88074-1.50009-3openalex-snapshot
Automata on Infinite Objects
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/2011113openalex-snapshot
Some problems in automata theory which depend on the models of set theory
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.1109/wodes.2008.4605948openalex-snapshot
A topological perspective on diagnosis
inferred← citeshttps://doi.org/10.1142/s0129054121500283openalex-snapshot
Two Effective Properties of ω-Rational Functions
inferred← citeshttps://doi.org/10.2168/lmcs-5(4:4)2009openalex-snapshot
The Complexity of Infinite Computations In Models of Set Theory
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.