On the public citation graph
Recent results in the theory of rational sets
0 signed · 55 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-07407-4_22openalex-snapshot
Sur les relations rationnelles
inferredcites →https://doi.org/10.1007/3-540-16078-7_78openalex-snapshot
Decomposition de Fonctions Rationnelles
inferredcites →https://doi.org/10.1007/978-3-642-82456-2_23openalex-snapshot
Words over a Partially Commutative Alphabet
inferredcites →https://doi.org/10.1007/978-3-663-09367-1openalex-snapshot
Transductions and Context-Free Languages
inferredcites →https://doi.org/10.1007/bfb0015755openalex-snapshot
Do rational equivalence relations have regular cross-sections?
inferredcites →https://doi.org/10.1007/bfb0016259openalex-snapshot
Fibonacci numeration systems and rational functions
inferredcites →https://doi.org/10.1007/bfb0030293openalex-snapshot
Traces, histories, graphs: Instances of a process monoid
inferredcites →https://doi.org/10.1007/bfb0036926openalex-snapshot
On the composition of morphisms and inverse morphisms
inferredcites →https://doi.org/10.1007/bfb0079468openalex-snapshot
Problèmes combinatoires de commutation et réarrangements
inferredcites →https://doi.org/10.1016/0021-8693(69)90015-5openalex-snapshot
Equidivisible semigroups
inferredcites →https://doi.org/10.1016/0021-8693(69)90070-2openalex-snapshot
Rational sets in commutative monoids
inferredcites →https://doi.org/10.1016/0021-8693(71)90094-9openalex-snapshot
Deux applications de la représentation matricielle d'une série rationnelle non commutative
inferredcites →https://doi.org/10.1016/0166-218x(82)90072-5openalex-snapshot
A homomorphic characterization of regular languages
inferredcites →https://doi.org/10.1016/0166-218x(83)90045-8openalex-snapshot
A note on morphic characterization of languages
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(77)90049-4openalex-snapshot
Une caracterisation des fonctions sequentielles et des fonctions sous-sequentielles en tant que relations rationnelles
inferredcites →https://doi.org/10.1016/0304-3975(77)90055-xopenalex-snapshot
Sur une variante des fonctions sequentielles
inferredcites →https://doi.org/10.1016/0304-3975(79)90049-5openalex-snapshot
A new proof of two theorems about rational transductions
inferredcites →https://doi.org/10.1016/0304-3975(85)90013-1openalex-snapshot
Recognizable subsets of some partially abelian monoids
inferredcites →https://doi.org/10.1016/0304-3975(85)90059-3openalex-snapshot
An algorithm to decide whether a rational subset of Nk is recognizable
inferredcites →https://doi.org/10.1016/0304-3975(85)90206-3openalex-snapshot
Maximal serializability of iterated transactions
inferredcites →https://doi.org/10.1016/0304-3975(86)90028-9openalex-snapshot
On some equations in free partially commutative monoids
inferredcites →https://doi.org/10.1016/0304-3975(87)90080-6openalex-snapshot
On regular trace languages
inferredcites →https://doi.org/10.1016/0890-5401(87)90020-4openalex-snapshot
Easy multiplications I. The realm of Kleene's theorem
inferredcites →https://doi.org/10.1016/s0019-9958(65)90275-5openalex-snapshot
Generalizations of regular events
inferredcites →https://doi.org/10.1016/s0019-9958(69)90651-2openalex-snapshot
Classification of formal languages by functional binary transductions
inferredcites →https://doi.org/10.1016/s0022-0000(68)80006-6openalex-snapshot
Multitape one-way nonwriting automata
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.1051/ita/1985190100211openalex-snapshot
Automates et commutations partielles
inferredcites →https://doi.org/10.1051/ita/1985190302811openalex-snapshot
Sur les semi-groupes vérifiant le théorème de Kleene
inferredcites →https://doi.org/10.1051/ita/1986200201031openalex-snapshot
Trace languages defined by regular string languages
inferredcites →https://doi.org/10.1051/ita/1986200201211openalex-snapshot
Une condition suffisante de reconnaissabilité dans un monoïde partiellement commutatif
inferredcites →https://doi.org/10.1090/s0002-9947-1964-0181500-1openalex-snapshot
Bounded 𝐴𝐿𝐺𝑂𝐿-like languages
inferredcites →https://doi.org/10.1147/rd.91.0047openalex-snapshot
On Relations Defined by Generalized Finite Automata
inferredcites →https://doi.org/10.2140/pjm.1966.16.285openalex-snapshot
Semigroups, Presburger formulas, and languages
inferredcites →https://doi.org/10.4153/cjm-1966-040-3openalex-snapshot
A Characterization of Machine Mappings
What points at this work
Incoming claims: where this work appears in other papers’ reference lists and arguments.
inferred← citeshttps://doi.org/10.1007/3-540-18088-5_20openalex-snapshot
Decision problems for regular trace languages
inferred← citeshttps://doi.org/10.1007/3-540-54345-7_84openalex-snapshot
Composition of two semi commutations
inferred← citeshttps://doi.org/10.1007/978-3-319-19225-3_1openalex-snapshot
Unambiguity in Automata Theory
inferred← citeshttps://doi.org/10.1007/bf02088289openalex-snapshot
Characterizations of the decidability of some problems for regular trace languages
inferred← citeshttps://doi.org/10.1007/bfb0017135openalex-snapshot
Recognizable sets with multiplicities in the tropical semiring
inferred← citeshttps://doi.org/10.1007/bfb0029610openalex-snapshot
Decomposition of semi commutations
inferred← citeshttps://doi.org/10.1007/bfb0032054openalex-snapshot
Decomposition of partial commutations
inferred← citeshttps://doi.org/10.1007/bfb0035857openalex-snapshot
On the existence of the minimum asynchronous automaton and on decision problems for unambiguous regular trace languages
inferred← citeshttps://doi.org/10.1007/s002360050045openalex-snapshot
On the rational subsets of the free group
inferred← citeshttps://doi.org/10.1016/0304-3975(91)90087-iopenalex-snapshot
Event structures and trace monoids
inferred← citeshttps://doi.org/10.1016/0304-3975(91)90162-uopenalex-snapshot
Which Kleene semigroups are finite?
inferred← citeshttps://doi.org/10.1016/0304-3975(92)90337-fopenalex-snapshot
On a kind of Fatou property of context-free groups
inferred← citeshttps://doi.org/10.1017/cbo9781316227343.024openalex-snapshot
The rational subset membership problem for groups: a survey
inferred← citeshttps://doi.org/10.1051/ita/1991250302551openalex-snapshot
On a subclass of context-free groups
inferred← citeshttps://doi.org/10.1137/22m1512612openalex-snapshot
Decidability of Membership Problems for Flat Rational Subsets of \(\boldsymbol{{\textrm{GL}}(2,\boldsymbol{{\mathbb{Q}}})}\) and Singular Matrices
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.