On the public citation graph
Relational morphisms, transductions and operations on languages
0 signed · 32 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/3-540-09118-1_27openalex-snapshot
Sur les varietes de langages et de monoïdes
inferredcites →https://doi.org/10.1007/3-540-10843-2_15openalex-snapshot
Langages Reconnaissables et Codage Prefixe Pur
inferredcites →https://doi.org/10.1007/978-1-4613-2215-3openalex-snapshot
Varieties of Formal Languages
inferredcites →https://doi.org/10.1007/978-3-663-09367-1openalex-snapshot
Transductions and Context-Free Languages
inferredcites →https://doi.org/10.1007/978-94-009-3839-7_18openalex-snapshot
Power Semigroups and Related Varieties of Finite Semigroups
inferredcites →https://doi.org/10.1007/bf02574198openalex-snapshot
Recognizable sets and power sets of finite semigroups
inferredcites →https://doi.org/10.1007/bfb0036488openalex-snapshot
Some operations and transductions that preserve rationality
inferredcites →https://doi.org/10.1007/bfb0036942openalex-snapshot
Arbres et hierarchies de concatenation
inferredcites →https://doi.org/10.1016/0022-0000(82)90051-4openalex-snapshot
Limitedness theorem on finite automata with distance functions
inferredcites →https://doi.org/10.1016/0022-0000(83)90031-4openalex-snapshot
Representation theorems on regular languages
inferredcites →https://doi.org/10.1016/0022-4049(79)90025-2openalex-snapshot
Aperiodic homomorphisms and the concatenation product of recognizable sets
inferredcites →https://doi.org/10.1016/0022-4049(88)90097-7openalex-snapshot
Locally trivial categories and unambiguous concatenation
inferredcites →https://doi.org/10.1016/0304-3975(79)90057-4openalex-snapshot
A decision procedure for the order of regular events
inferredcites →https://doi.org/10.1016/0304-3975(85)90019-2openalex-snapshot
Une application de la representation matricielle des transductions
inferredcites →https://doi.org/10.1016/0304-3975(90)90044-iopenalex-snapshot
Improved limitedness theorems on finite automata with distance functions
inferredcites →https://doi.org/10.1016/s0019-9958(82)91028-2openalex-snapshot
Regular languages of star height one
inferredcites →https://doi.org/10.1016/s0079-8169(08)x6055-6openalex-snapshot
Automata, Languages, and Machines
inferredcites →https://doi.org/10.1051/ita/1981150201491openalex-snapshot
Relational morphisms and operations on recognizable sets
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-031-57228-9openalex-snapshot
Foundations of Software Science and Computation Structures
inferred← citeshttps://doi.org/10.1007/978-3-031-57228-9_8openalex-snapshot
Monoidal Extended Stone Duality
inferred← citeshttps://doi.org/10.1007/978-3-642-39212-2_29openalex-snapshot
Algebras, Automata and Logic for Languages of Labeled Birooted Trees
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.1016/j.fss.2008.11.024openalex-snapshot
Fuzzy homomorphisms of algebras
inferred← citeshttps://doi.org/10.1016/j.ic.2014.12.016openalex-snapshot
On labeled birooted tree languages: Algebras, automata and logic
inferred← citeshttps://doi.org/10.1016/j.jcss.2019.02.001openalex-snapshot
Finite-state independence and normal sequences
inferred← citeshttps://doi.org/10.1016/s0304-3975(96)00120-xopenalex-snapshot
Polynomial closure of group languages and open sets of the Hall topology
inferred← citeshttps://doi.org/10.1017/s0305004100075332openalex-snapshot
Semigroups whose idempotents form a subsemigroup
inferred← citeshttps://doi.org/10.1134/s0081543815020157openalex-snapshot
On the pseudovariety generated by all finite monoids satisfying R = H
inferred← citeshttps://doi.org/10.48550/arxiv.1702.00320openalex-snapshot
Finite-state Independence and Normal Sequences
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.