On the public citation graph
A property of the Schützenberger product
0 signed · 25 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-15641-0_19openalex-snapshot
An introduction to finite automata on infinite words
inferredcites →https://doi.org/10.1007/bfb0036942openalex-snapshot
Arbres et hierarchies de concatenation
inferredcites →https://doi.org/10.1016/0021-8693(87)90047-0openalex-snapshot
Expansions, free inverse semigroups, and Schützenberger product
inferredcites →https://doi.org/10.1016/0022-4049(84)90092-6openalex-snapshot
Almost finite expansions of arbitrary semigroups
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/b978-0-12-198820-3.50016-4openalex-snapshot
CONCATENATION HIERARCHIES DECIDABILITY RESULTS AND PROBLEMS
inferredcites →https://doi.org/10.1016/s0012-365x(73)80005-6openalex-snapshot
Characterizations of locally testable events
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
inferredcites →https://doi.org/10.1051/ita/1983170403211openalex-snapshot
A semigroup characterization of dot-depth one languages
inferredcites →https://doi.org/10.1051/ita/1984180100231openalex-snapshot
Hiérarchies de concaténation
inferredcites →https://doi.org/10.1112/blms/12.3.230bopenalex-snapshot
SEMIGROUPS AND COMBINATORIAL APPLICATIONS
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-60084-1_87openalex-snapshot
Polynomial closure and unambiguous product
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/bf02573578openalex-snapshot
Some results on the dot-depth hierarchy
inferred← citeshttps://doi.org/10.1007/bf02679467openalex-snapshot
Polynomial closure and unambiguous product
inferred← citeshttps://doi.org/10.1007/s11587-022-00743-zopenalex-snapshot
Some remarks on the Schützenberger product of n monoids
inferred← citeshttps://doi.org/10.1016/s0304-3975(01)00230-4openalex-snapshot
Algebraic tools for the concatenation product
inferred← citeshttps://doi.org/10.1051/ita:2001134openalex-snapshot
A conjecture on the concatenation product
inferred← citeshttps://doi.org/10.1080/00927879808826163openalex-snapshot
Irreducibility of certain pseudovarieties1
inferred← citeshttps://doi.org/10.1142/s0129054108005802openalex-snapshot
A SURVEY ON SMALL FRAGMENTS OF FIRST-ORDER LOGIC OVER FINITE WORDS
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.