On the public citation graph
Rational relations with bounded delay
0 signed · 22 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/978-3-663-09367-1openalex-snapshot
Transductions and Context-Free Languages
inferredcites →https://doi.org/10.1007/bf01368783openalex-snapshot
Representations of numbers and finite automata
inferredcites →https://doi.org/10.1007/bfb0013106openalex-snapshot
Formal Properties of Finite Automata and Applications
inferredcites →https://doi.org/10.1007/bfb0013115openalex-snapshot
Automata and quantifier hierarchies
inferredcites →https://doi.org/10.1016/s0079-8169(08)x6055-6openalex-snapshot
Automata, Languages, and Machines
inferredcites →https://doi.org/10.1051/ita/1981150201411openalex-snapshot
Transductions rationnelles décroissantes
inferredcites →https://doi.org/10.1051/ita/1983170100231openalex-snapshot
Deux remarques sur un théorème de S. Eilenberg
inferredcites →https://doi.org/10.1109/lics.1990.113750openalex-snapshot
The theory of ground rewrite systems is decidable
What points at this work
Incoming claims: where this work appears in other papers’ reference lists and arguments.
inferred← citeshttps://doi.org/10.1007/978-1-4757-2574-2_8openalex-snapshot
Combinatorial Criteria Over Graphs of Specification to Decide Synthesis by Sequential Circuits
inferred← citeshttps://doi.org/10.1007/978-3-319-02444-8_30openalex-snapshot
Robustness Analysis of String Transducers
inferred← citeshttps://doi.org/10.1007/978-3-642-35873-9_15openalex-snapshot
Robustness Analysis of Networked Systems
inferred← citeshttps://doi.org/10.1007/bf01185566openalex-snapshot
On the lengths of values in a finite transducer
inferred← citeshttps://doi.org/10.1007/bf01368783openalex-snapshot
Representations of numbers and finite automata
inferred← citeshttps://doi.org/10.1016/0304-3975(92)90036-fopenalex-snapshot
Systèmes de numération linéaires et θ-représentations
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)90278-nopenalex-snapshot
On the regular structure of prefix rewriting
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.1109/arith.1991.145528openalex-snapshot
Representation of numbers in nonclassical numeration systems
inferred← citeshttps://doi.org/10.1145/1807085.1807089openalex-snapshot
Expressive languages for path queries over graph-structured data
inferred← citeshttps://doi.org/10.1145/2389241.2389250openalex-snapshot
Expressive Languages for Path Queries over Graph-Structured Data
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.