On the public citation graph
Equations and dot-depth one
0 signed · 39 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-16761-7_91openalex-snapshot
Semigroups and languages of dot-depth 2
inferredcites →https://doi.org/10.1016/0022-0000(78)90049-1openalex-snapshot
The dot-depth hierarchy of star-free languages is infinite
inferredcites →https://doi.org/10.1016/0022-0000(82)90016-2openalex-snapshot
Classifying regular events in symbolic logic
inferredcites →https://doi.org/10.1016/0022-4049(85)90062-3openalex-snapshot
Finite semigroup varieties of the form V ∗ D
inferredcites →https://doi.org/10.1016/0166-218x(92)90161-3openalex-snapshot
Games, equations and dot-depth two monoids
inferredcites →https://doi.org/10.1016/0304-3975(88)90034-5openalex-snapshot
Semigroups and languages of dot-depth two
inferredcites →https://doi.org/10.1016/0898-1221(89)90179-xopenalex-snapshot
Games, equations and the dot-depth hierarchy
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/s0022-0000(71)80003-xopenalex-snapshot
Dot-depth of star-free events
inferredcites →https://doi.org/10.1016/s0079-8169(08)x6055-6openalex-snapshot
Automata, Languages, and Machines
inferredcites →https://doi.org/10.1051/ita/1983170403211openalex-snapshot
A semigroup characterization of dot-depth one languages
inferredcites →https://doi.org/10.1051/ita/1983170403311openalex-snapshot
Some theorems on graph congruences
inferredcites →https://doi.org/10.1112/blms/12.3.230bopenalex-snapshot
SEMIGROUPS AND COMBINATORIAL APPLICATIONS
inferredcites →https://doi.org/10.24033/msmf.309openalex-snapshot
An application of the Ehrenfeucht-Fraisse game in formal language theory
What points at this work
Incoming claims: where this work appears in other papers’ reference lists and arguments.
inferred← citeshttps://doi.org/10.1006/jcss.1995.1071openalex-snapshot
Some Logical Characterizations of the Dot-Depth Hierarchy and Applications
inferred← citeshttps://doi.org/10.1007/3-540-60084-1_87openalex-snapshot
Polynomial closure and unambiguous product
inferred← citeshttps://doi.org/10.1007/bf02573472openalex-snapshot
Equations on the semidirect product of a finite semilattice by a finite commutative monoid
inferred← citeshttps://doi.org/10.1007/bf02679467openalex-snapshot
Polynomial closure and unambiguous product
inferred← citeshttps://doi.org/10.1007/pl00005913openalex-snapshot
Equations on Semidirect Products of Commutative Semigroups
inferred← citeshttps://doi.org/10.1007/s00012-021-00738-1openalex-snapshot
Equational theories of upper triangular tropical matrix semigroups
inferred← citeshttps://doi.org/10.1007/s00233-019-09996-xopenalex-snapshot
Identities in unitriangular and gossip monoids
inferred← citeshttps://doi.org/10.1007/s00233-022-10305-2openalex-snapshot
Identities of the stylic monoid
inferred← citeshttps://doi.org/10.1007/s00233-022-10328-9openalex-snapshot
Tropical representations and identities of the stylic monoid
inferred← citeshttps://doi.org/10.1016/0166-218x(95)00047-uopenalex-snapshot
Inclusion relations between some congruences related to the dot-depth hierarchy
inferred← citeshttps://doi.org/10.1016/0304-3975(92)00064-xopenalex-snapshot
Equations and monoid varieties of dot-depth one and two
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.1051/ita/1995290301571openalex-snapshot
Equations on the semidirect product of a finite semilattice by a $\mathcal {J}$-trivial monoid of height $k$
inferred← citeshttps://doi.org/10.1051/ita/1996300504571openalex-snapshot
On semidirect and two-sided semidirect products of finite $\mathcal {J}$trivial monoids
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.1515/dema-2015-0035openalex-snapshot
The Finite Basis Problem for Kiselman 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.