On the public citation graph
On finite ℐ-trivial monoids
0 signed · 38 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/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.1006/jabr.1997.6783openalex-snapshot
Monoids Respectingn-Chains of Intervals
inferred← citeshttps://doi.org/10.1007/978-3-540-85780-8_38openalex-snapshot
Hierarchies of Piecewise Testable Languages
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/978-94-009-3839-7_21openalex-snapshot
Finite J-Trivial Monoids and Partially Ordered Monoids
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-981-33-4842-4_3openalex-snapshot
Block-Groups and Hall Relations
inferred← citeshttps://doi.org/10.1007/bf02573319openalex-snapshot
Power monoids and finiteJ-trivial monoids
inferred← citeshttps://doi.org/10.1007/s00012-019-0637-xopenalex-snapshot
Finite basis problem for involution monoids of unitriangular boolean matrices
inferred← citeshttps://doi.org/10.1007/s00233-018-9916-7openalex-snapshot
Left and right negatively orderable semigroups and a one-sided version of Simon’s theorem
inferred← citeshttps://doi.org/10.1007/s00233-019-09999-8openalex-snapshot
The influence of Imre Simon’s work in the theory of automata, languages and semigroups
inferred← citeshttps://doi.org/10.1007/s00233-022-10305-2openalex-snapshot
Identities of the stylic monoid
inferred← citeshttps://doi.org/10.1016/0021-8693(86)90070-0openalex-snapshot
Infinite iteration of matrix semigroups II. Structure theorem for arbitrary semigroups up to aperiodic morphism
inferred← citeshttps://doi.org/10.1016/0021-8693(88)90067-1openalex-snapshot
Partially ordered finite monoids and a theorem of I. Simon
inferred← citeshttps://doi.org/10.1016/0022-4049(91)90019-xopenalex-snapshot
Implicit operations on finite J-trivial semigroups and a conjecture of I. Simon
inferred← citeshttps://doi.org/10.1016/b978-0-12-198820-3.50016-4openalex-snapshot
CONCATENATION HIERARCHIES DECIDABILITY RESULTS AND PROBLEMS
inferred← citeshttps://doi.org/10.1016/b978-0-12-198820-3.50021-8openalex-snapshot
SUBWORD COUNTING AND NILPOTENT GROUPS
inferred← citeshttps://doi.org/10.1016/j.jalgebra.2022.04.033openalex-snapshot
Representations and identities of plactic-like monoids
inferred← citeshttps://doi.org/10.1016/j.jalgebra.2023.06.014openalex-snapshot
Catalan monoids inherently nonfinitely based relative to finite R -trivial semigroups
inferred← citeshttps://doi.org/10.1016/j.jalgebra.2025.07.045openalex-snapshot
Equational theories of the Boolean matrix monoid BRn with involutions
inferred← citeshttps://doi.org/10.1016/j.jsc.2024.102415openalex-snapshot
Minimal generating sets for matrix monoids
inferred← citeshttps://doi.org/10.1017/s0013091509001795openalex-snapshot
Idempotent-generated semigroups and pseudovarieties
inferred← citeshttps://doi.org/10.1051/ita:2005002openalex-snapshot
The pseudovariety of semigroups of triangular matrices over a finite field
inferred← citeshttps://doi.org/10.1080/00927870500454075openalex-snapshot
Presentations of the Schützenberger Product of n Groups
inferred← citeshttps://doi.org/10.1134/s0081543814090132openalex-snapshot
The structure of finite monoids satisfying the relation ℛ = ℋ
inferred← citeshttps://doi.org/10.1134/s0081543815020157openalex-snapshot
On the pseudovariety generated by all finite monoids satisfying R = H
inferred← citeshttps://doi.org/10.1134/s0081543816020218openalex-snapshot
Characterization of the pseudovariety generated by finite monoids satisfying ℛ = ℋ
inferred← citeshttps://doi.org/10.1142/s0129054110007404openalex-snapshot
HIERARCHIES OF PIECEWISE TESTABLE LANGUAGES
inferred← citeshttps://doi.org/10.1142/s0218196701000437openalex-snapshot
THE GAP BETWEEN PARTIAL AND FULL: AN ADDENDUM
inferred← citeshttps://doi.org/10.1142/s0218196704002018openalex-snapshot
REFLEXIVE RELATIONS, EXTENSIVE TRANSFORMATIONS AND PIECEWISE TESTABLE LANGUAGES OF A GIVEN HEIGHT
inferred← citeshttps://doi.org/10.1142/s021819670800486xopenalex-snapshot
ORDERED AND $\mathcal{J}$-TRIVIAL SEMIGROUPS AS DIVISORS OF SEMIGROUPS OF LANGUAGES
inferred← citeshttps://doi.org/10.1142/s0218196710005935openalex-snapshot
ORDERED SEMIGROUPS, UPPER-TRIANGULAR REFLEXIVE RELATIONS AND SEMIGROUPS OF LANGUAGES
inferred← citeshttps://doi.org/10.1142/s0218196798000193openalex-snapshot
The Gap Between Partial and Full
inferred← citeshttps://doi.org/10.1515/dema-2015-0035openalex-snapshot
The Finite Basis Problem for Kiselman Monoids
inferred← citeshttps://doi.org/10.48550/arxiv.2012.10323openalex-snapshot
Minimal generating sets for matrix monoids
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.