On the public citation graph
The wreath product and its applications
0 signed · 24 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.1016/0001-8708(73)90007-8openalex-snapshot
Chapter 1. Extension of the fundamental theorem of finite semigroups
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/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/s0012-365x(73)80005-6openalex-snapshot
Characterizations of locally testable events
inferredcites →https://doi.org/10.1016/s0019-9958(65)90108-7openalex-snapshot
On finite monoids having only trivial subgroups
inferredcites →https://doi.org/10.1016/s0079-8169(08)x6055-6openalex-snapshot
Automata, Languages, and Machines
inferredcites →https://doi.org/10.1090/s0002-9947-1965-0188316-1openalex-snapshot
Algebraic Theory of Machines. I. Prime Decomposition Theorem for Finite Semigroups and Machines
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-642-21254-3_22openalex-snapshot
Classifying Regular Languages via Cascade Products of Automata
inferred← citeshttps://doi.org/10.1007/bfb0028588openalex-snapshot
Expressive completeness of LTrL on finite traces: An algebraic proof
inferred← citeshttps://doi.org/10.1007/bfb0055073openalex-snapshot
Bridges for concatenation hierarchies
inferred← citeshttps://doi.org/10.1007/s00233-008-9122-0openalex-snapshot
The rank of the endomorphism monoid of a uniform partition
inferred← citeshttps://doi.org/10.1007/s10474-009-8025-1openalex-snapshot
The generalized Szendrei expansion of an ℜ-unipotent semigroup
inferred← citeshttps://doi.org/10.1016/j.jcss.2006.09.004openalex-snapshot
Languages polylog-time reducible to dot-depth 1/2
inferred← citeshttps://doi.org/10.1017/s0305004115000389openalex-snapshot
The rank of the semigroup of transformations stabilising a partition of a finite set
inferred← citeshttps://doi.org/10.1017/s096012951000054xopenalex-snapshot
Pointwise extensions of GSOS-defined operations
inferred← citeshttps://doi.org/10.1081/agb-120016005openalex-snapshot
THE WREATH PRODUCT PRINCIPLE FOR ORDERED SEMIGROUPS
inferred← citeshttps://doi.org/10.1142/9789813148208_0007openalex-snapshot
Open Problems About Regular Languages, 35 Years Later
inferred← citeshttps://doi.org/10.25596/jalc-2009-149openalex-snapshot
Languages Recognized by Finite Supersoluble Groups
inferred← citeshttps://doi.org/10.48550/arxiv.0807.1214openalex-snapshot
The Rank of the Endomorphism Monoid of a Partition
inferred← citeshttps://doi.org/10.82308/31455openalex-snapshot
Applications of algebraic automata theory to quantum finite automata
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.