On the public citation graph

Varietes de semigroupes et mots infinis

https://doi.org/10.1007/bfb0036941
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.
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.1016/0022-4049(79)90025-2openalex-snapshot
Aperiodic homomorphisms and the concatenation product of recognizable sets
inferredcites →https://doi.org/10.1016/s0019-9958(77)90443-0openalex-snapshot
Application of model theoretic games to discrete linear orders and finite automata
inferredcites →https://doi.org/10.1016/s0019-9958(79)90629-6openalex-snapshot
Star-free regular sets of ω-sequences
inferredcites →https://doi.org/10.1016/s0019-9958(81)90663-xopenalex-snapshot
A combinatorial approach to the theory of ω-automata
inferredcites →https://doi.org/10.1145/800070.802176openalex-snapshot
Ensembles reconnaissables de mots biinfinis

What points at this work

Incoming claims: where this work appears in other papers’ reference lists and arguments.

inferred← citeshttps://doi.org/10.1006/inco.2000.3009openalex-snapshot
Star-Free Sets of Words on Ordinals
inferred← citeshttps://doi.org/10.1007/3-540-16078-7_75openalex-snapshot
Varietes de Semis Groupes et Mots Infinis
inferred← citeshttps://doi.org/10.1007/3-540-16761-7_79openalex-snapshot
Etude syntaxique des parties reconnaissables de mots infinis
inferred← citeshttps://doi.org/10.1007/3-540-54233-7_166openalex-snapshot
An EILENBERG theorem for ∞-languages
inferred← citeshttps://doi.org/10.1007/978-94-011-0149-3_3openalex-snapshot
Semigroups and Automata on Infinite Words
inferred← citeshttps://doi.org/10.1007/bf02127803openalex-snapshot
Logic, semigroups and automata on words
inferred← citeshttps://doi.org/10.1007/bfb0035752openalex-snapshot
Factors of words
inferred← citeshttps://doi.org/10.1007/bfb0054310openalex-snapshot
An Eilenberg theorem for words on countable ordinals
inferred← citeshttps://doi.org/10.1007/bfb0054312openalex-snapshot
Positive varieties and infinite words
inferred← citeshttps://doi.org/10.1016/0020-0190(95)95252-uopenalex-snapshot
A negative answer to a question of Wilke on varieties of ω-languages
inferred← citeshttps://doi.org/10.1016/0304-3975(86)90136-2openalex-snapshot
On the complementation of Büchi automata
inferred← citeshttps://doi.org/10.1016/0304-3975(88)90029-1openalex-snapshot
Etude syntaxique des parties reconnaissables de mots infinis
inferred← citeshttps://doi.org/10.1016/0304-3975(92)90006-2openalex-snapshot
Varieties of finite monoids and Büchi-McNaughton theorem
inferred← citeshttps://doi.org/10.1016/b978-0-444-88074-1.50009-3openalex-snapshot
Automata on Infinite Objects
inferred← citeshttps://doi.org/10.1016/j.jcss.2011.06.003openalex-snapshot
Schützenberger and Eilenberg theorems for words on linear orderings
inferred← citeshttps://doi.org/10.1016/s0022-4049(99)00093-6openalex-snapshot
Wreath product and infinite words
inferred← citeshttps://doi.org/10.2168/lmcs-3(1:4)2007openalex-snapshot
Logic Meets Algebra: the Case of Regular Languages
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.