On the public citation graph

Recognizable sets and power sets of finite semigroups

0 signed · 43 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/0304-3975(78)90049-xopenalex-snapshot
Varietes de langages et operations
inferredcites →https://doi.org/10.1016/s0079-8169(08)x6055-6openalex-snapshot
Automata, Languages, 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/3-540-10843-2_15openalex-snapshot
Langages Reconnaissables et Codage Prefixe Pur
inferred← citeshttps://doi.org/10.1007/3-540-12689-9_107openalex-snapshot
On languages generated by semigroups
inferred← citeshttps://doi.org/10.1007/3-540-51486-4_99openalex-snapshot
On varieties of languages closed under products with counter
inferred← citeshttps://doi.org/10.1007/3-540-56939-1_92openalex-snapshot
The product of rational languages
inferred← citeshttps://doi.org/10.1007/978-1-4899-2608-1_31openalex-snapshot
An Extension of the Schützenberger Product
inferred← citeshttps://doi.org/10.1007/978-3-031-19685-0_3openalex-snapshot
Shuffle Product of Regular Languages: Results and Open Problems
inferred← citeshttps://doi.org/10.1007/978-3-032-28404-4_3openalex-snapshot
Seventy Years of Algebraic, Logical, and Topological Methods for Regular Languages
inferred← citeshttps://doi.org/10.1007/978-3-540-85238-4_3openalex-snapshot
A Robust Class of Regular Languages
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-3-642-38771-5_5openalex-snapshot
An Explicit Formula for the Intersection of Two Polynomials of Regular Languages
inferred← citeshttps://doi.org/10.1007/978-3-642-59136-5_10openalex-snapshot
Syntactic Semigroups
inferred← citeshttps://doi.org/10.1007/978-94-009-3839-7_18openalex-snapshot
Power Semigroups and Related Varieties of Finite Semigroups
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/978-94-011-0149-3_2openalex-snapshot
BG = PG: A Success Story
inferred← citeshttps://doi.org/10.1007/bf01196091openalex-snapshot
Power structures
inferred← citeshttps://doi.org/10.1007/bf02572667openalex-snapshot
Varietes de langages et monoide des parties
inferred← citeshttps://doi.org/10.1007/bf02572813openalex-snapshot
On M-varieties generated by power monoids
inferred← citeshttps://doi.org/10.1007/bf02573209openalex-snapshot
Power pseudovarieties of semigroups I
inferred← citeshttps://doi.org/10.1007/bf02573210openalex-snapshot
Power pseudovarieties of semigroups II
inferred← citeshttps://doi.org/10.1007/bf02573319openalex-snapshot
Power monoids and finiteJ-trivial monoids
inferred← citeshttps://doi.org/10.1007/bf02574266openalex-snapshot
Monoides de comptage et langages rationnels
inferred← citeshttps://doi.org/10.1007/bfb0013110openalex-snapshot
Relational morphisms, transductions and operations on languages
inferred← citeshttps://doi.org/10.1007/bfb0017300openalex-snapshot
Un analogue du theoreme des varietes pour les cones et les cylindres
inferred← citeshttps://doi.org/10.1007/bfb0028813openalex-snapshot
Products of group languages
inferred← citeshttps://doi.org/10.1007/bfb0036488openalex-snapshot
Some operations and transductions that preserve rationality
inferred← citeshttps://doi.org/10.1007/bfb0039607openalex-snapshot
Polynomial operations on rational languages
inferred← citeshttps://doi.org/10.1016/0021-8693(89)90183-xopenalex-snapshot
On power varieties of semigroups
inferred← citeshttps://doi.org/10.1016/0022-0000(92)90029-iopenalex-snapshot
Closure of varieties of languages under products with counter
inferred← citeshttps://doi.org/10.1016/0022-4049(82)90005-6openalex-snapshot
On varieties of rational languages and variable-length codes
inferred← citeshttps://doi.org/10.1016/0304-3975(85)90019-2openalex-snapshot
Une application de la representation matricielle des transductions
inferred← citeshttps://doi.org/10.1016/0304-3975(90)90019-eopenalex-snapshot
Products of languages with counter
inferred← citeshttps://doi.org/10.1016/0304-3975(93)90227-kopenalex-snapshot
Locally commutative power semigroups and counting factors of words
inferred← citeshttps://doi.org/10.1016/j.jpaa.2011.10.022openalex-snapshot
Upper set monoids and length preserving morphisms
inferred← citeshttps://doi.org/10.1016/j.tcs.2003.10.034openalex-snapshot
Shuffle on positive varieties of languages
inferred← citeshttps://doi.org/10.1016/j.tcs.2004.12.027openalex-snapshot
Constructing divisions into power groups
inferred← citeshttps://doi.org/10.1016/j.topol.2019.106975openalex-snapshot
Difference hierarchies and duality with an application to formal languages
inferred← citeshttps://doi.org/10.1051/ita/1981150201491openalex-snapshot
Relational morphisms and operations on recognizable sets
inferred← citeshttps://doi.org/10.1142/s021819671540010xopenalex-snapshot
On fixed points of the lower set operator
inferred← citeshttps://doi.org/10.1142/s0218196725500043openalex-snapshot
The pseudovariety Com ∗D viewed as a power pseudovariety
inferred← citeshttps://doi.org/10.14232/actacyb.23.1.2017.7openalex-snapshot
Commutative Positive Varieties of Languages
inferred← citeshttps://doi.org/10.48550/arxiv.1811.12339openalex-snapshot
A note on powers of Boolean spaces with internal semigroups
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.