On the public citation graph

Some operations and transductions that preserve rationality

https://doi.org/10.1007/bfb0036488
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.
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/3-540-09118-1_27openalex-snapshot
Sur les varietes de langages et de monoïdes
inferredcites →https://doi.org/10.1007/978-3-663-09367-1openalex-snapshot
Transductions and Context-Free Languages
inferredcites →https://doi.org/10.1007/bf02572548openalex-snapshot
Sur le calcul du monoïde syntaxique d'un sous monoïde finiment engendré
inferredcites →https://doi.org/10.1007/bf02574198openalex-snapshot
Recognizable sets and power sets of finite semigroups
inferredcites →https://doi.org/10.1016/0020-0190(81)90067-3openalex-snapshot
A closure property of deterministic context-free languages
inferredcites →https://doi.org/10.1016/0022-4049(79)90024-0openalex-snapshot
Families of recognizable sets corresponding to certain varieties of finite monoids
inferredcites →https://doi.org/10.1016/0304-3975(76)90026-8openalex-snapshot
Sur les relations rationnelles entre monoides libres
inferredcites →https://doi.org/10.1016/0304-3975(78)90049-xopenalex-snapshot
Varietes de langages et operations
inferredcites →https://doi.org/10.1016/0304-3975(79)90036-7openalex-snapshot
Sur les series associees a certains systemes de lindenmayer
inferredcites →https://doi.org/10.1016/0304-3975(81)90036-0openalex-snapshot
A generalization of the Schützenberger product of finite monoids
inferredcites →https://doi.org/10.1016/0378-4754(81)90068-9openalex-snapshot
Introduction to automata theory, languages and computation
inferredcites →https://doi.org/10.1016/s0079-8169(08)x6055-6openalex-snapshot
Automata, Languages, and Machines
inferredcites →https://doi.org/10.1051/ita/1984180100231openalex-snapshot
Hiérarchies de concaténation
inferredcites →https://doi.org/10.1145/321186.321191openalex-snapshot
Quotients of Context-Free Languages
inferredcites →https://doi.org/10.2307/1970044openalex-snapshot
Free Differential Calculus, IV. The Quotient Groups of the Lower Central Series

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-3-030-40608-0_5openalex-snapshot
How to Prove that a Language Is Regular or Star-Free?
inferred← citeshttps://doi.org/10.1007/978-3-032-28404-4_3openalex-snapshot
Seventy Years of Algebraic, Logical, and Topological Methods for Regular Languages
inferred← citeshttps://doi.org/10.1007/978-3-319-20028-6_8openalex-snapshot
Newton’s Forward Difference Equation for Functions from Words to Words
inferred← citeshttps://doi.org/10.1007/978-3-319-25150-9_15openalex-snapshot
Quotients of Unbounded Parallelism
inferred← citeshttps://doi.org/10.1007/978-3-540-30550-7_14openalex-snapshot
Semantic Shuffle on and Deletion Along Trajectories
inferred← citeshttps://doi.org/10.1007/978-3-540-45077-1_32openalex-snapshot
Operations Preserving Recognizable Languages
inferred← citeshttps://doi.org/10.1007/978-3-642-21493-6_3openalex-snapshot
Theme and Variations on the Concatenation Product
inferred← citeshttps://doi.org/10.1007/978-94-011-0149-3_1openalex-snapshot
Finite Semigroups and Recognizable Languages: An Introduction
inferred← citeshttps://doi.org/10.1007/bfb0013110openalex-snapshot
Relational morphisms, transductions and operations on languages
inferred← citeshttps://doi.org/10.1007/bfb0024023openalex-snapshot
Groups, codes and unambiguous automata
inferred← citeshttps://doi.org/10.1007/s00224-016-9694-0openalex-snapshot
On Boolean Closed Full Trios and Rational Kripke Frames
inferred← citeshttps://doi.org/10.1016/0022-4049(82)90005-6openalex-snapshot
On varieties of rational languages and variable-length codes
inferred← citeshttps://doi.org/10.1016/0022-4049(86)90013-7openalex-snapshot
Groups in the syntactic monoid of a composed code
inferred← citeshttps://doi.org/10.1016/j.ejc.2013.09.009openalex-snapshot
A noncommutative extension of Mahler’s theorem on interpolation series
inferred← citeshttps://doi.org/10.1016/j.ipl.2019.01.012openalex-snapshot
On shuffle products, acyclic automata and piecewise-testable languages
inferred← citeshttps://doi.org/10.1016/j.tcs.2005.03.029openalex-snapshot
A topological approach to transductions
inferred← citeshttps://doi.org/10.1016/j.tcs.2005.11.034openalex-snapshot
Operations preserving regular languages
inferred← citeshttps://doi.org/10.1017/s0960129521000074openalex-snapshot
Quantifiers on languages and codensity monads
inferred← citeshttps://doi.org/10.1109/lics.2015.56openalex-snapshot
Regularity Preserving but Not Reflecting Encodings
inferred← citeshttps://doi.org/10.1109/lics.2017.8005140openalex-snapshot
Quantifiers on languages and codensity monads
inferred← citeshttps://doi.org/10.23638/lmcs-16(1:24)2020openalex-snapshot
Continuity of Functional Transducers: A Profinite Study of Rational Functions
inferred← citeshttps://doi.org/10.25596/jalc-2009-149openalex-snapshot
Languages Recognized by Finite Supersoluble Groups
inferred← citeshttps://doi.org/10.4230/lipics.stacs.2008.1321openalex-snapshot
A Mahler's theorem for functions from words to integers
inferred← citeshttps://doi.org/10.5555/3329995.3330075openalex-snapshot
Quantifiers on languages and codensity monads
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.