On the public citation graph
A Noetherian and confluent rewrite system for idempotent semigroups
0 signed · 51 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/978-3-642-81955-1_23openalex-snapshot
Simple Word Problems in Universal Algebras
inferredcites →https://doi.org/10.1007/978-3-662-03563-4_4openalex-snapshot
Introduction to Formal Language Theory
inferredcites →https://doi.org/10.1016/0021-8693(70)90073-6openalex-snapshot
The lattice of equational classes of idempotent semigroups
inferredcites →https://doi.org/10.1016/0096-0551(80)90068-5openalex-snapshot
Introduction to formal language theory
inferredcites →https://doi.org/10.1016/b978-0-12-115350-2.50017-8openalex-snapshot
Equations and Rewrite Rules: A Survey
inferredcites →https://doi.org/10.1017/s0305004100027341openalex-snapshot
On semi-groups in which x r = x
inferredcites →https://doi.org/10.1017/s0305004100038482openalex-snapshot
On the finiteness of semigroups in which xr = x
inferredcites →https://doi.org/10.1090/surv/007.1openalex-snapshot
The Algebraic Theory of Semigroups, Volume I
inferredcites →https://doi.org/10.1145/1089208.1089210openalex-snapshot
A short survey on the state of the art in matching and unification problems
inferredcites →https://doi.org/10.1145/322217.322230openalex-snapshot
Confluent Reductions: Abstract Properties and Applications to Term Rewriting Systems
inferredcites →https://doi.org/10.1145/359657.359666openalex-snapshot
Abstract data types and software validation
inferredcites →https://doi.org/10.21236/ada087641openalex-snapshot
A Catalogue of Canonical Term Rewriting Systems.
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-15976-2_1openalex-snapshot
Basic features and development of the critical-pair/completion procedure
inferred← citeshttps://doi.org/10.1007/3-540-44612-5_41openalex-snapshot
Matching Modulo Associativity and Idempotency Is NP—Complete
inferred← citeshttps://doi.org/10.1007/3-540-47849-3_24openalex-snapshot
Pattern Equations and Equations with Stuttering
inferred← citeshttps://doi.org/10.1007/3-540-52885-7_102openalex-snapshot
Rewrite systems for varieties of semigroups
inferred← citeshttps://doi.org/10.1007/3-540-55210-3_212openalex-snapshot
Conditional semi-Thue systems for presenting monoids
inferred← citeshttps://doi.org/10.1007/3-540-56393-8_23openalex-snapshot
Semigroups satisfying x m+n = x n
inferred← citeshttps://doi.org/10.1007/978-3-319-41842-1_11openalex-snapshot
What Is Essential Unification?
inferred← citeshttps://doi.org/10.1007/978-3-540-31982-5_28openalex-snapshot
Expressivity of Coalgebraic Modal Logic: The Limits and Beyond
inferred← citeshttps://doi.org/10.1007/978-3-642-21493-6_12openalex-snapshot
Rewriting in Varieties of Idempotent Semigroups
inferred← citeshttps://doi.org/10.1007/978-3-642-24897-9_10openalex-snapshot
Identity Problems, Solvability of Equations and Unification in Varieties of Semigroups Related to Varieties of Groups
inferred← citeshttps://doi.org/10.1007/978-3-662-02328-0_21openalex-snapshot
A Noetherian Rewrite System for Idempotent Semigroups
inferred← citeshttps://doi.org/10.1007/978-94-009-3839-7_6openalex-snapshot
Free Bands and Free *-Bands
inferred← citeshttps://doi.org/10.1007/bf02328450openalex-snapshot
Unification under associativity and idempotence is of type nullary
inferred← citeshttps://doi.org/10.1007/bf02328451openalex-snapshot
The theory of idempotent semigroups is of unification type zero
inferred← citeshttps://doi.org/10.1007/bf02575010openalex-snapshot
Unification in varieties of idempotent semigroups
inferred← citeshttps://doi.org/10.1007/bfb0000071openalex-snapshot
Universal unification and a classification of equational theories
inferred← citeshttps://doi.org/10.1007/bfb0023839openalex-snapshot
On the Burnside semigroups x n = x n+m
inferred← citeshttps://doi.org/10.1016/b978-0-12-046371-8.50008-0openalex-snapshot
Completion and Its Applications
inferred← citeshttps://doi.org/10.1016/j.jpaa.2026.108219openalex-snapshot
Clones of pigmented words and realizations of special classes of monoids
inferred← citeshttps://doi.org/10.1016/j.tcs.2007.09.023openalex-snapshot
Expressivity of coalgebraic modal logic: The limits and beyond
inferred← citeshttps://doi.org/10.1016/j.tcs.2016.12.026openalex-snapshot
Strict coherence of conditional rewriting modulo axioms
inferred← citeshttps://doi.org/10.1016/j.tcs.2023.113783openalex-snapshot
Polynomial time multiplication and normal forms in free bands
inferred← citeshttps://doi.org/10.1016/s0747-7171(87)80020-2openalex-snapshot
History and basic features of the critical-pair/completion procedure
inferred← citeshttps://doi.org/10.1017/s0017089500006480openalex-snapshot
Free bands and free *-bands
inferred← citeshttps://doi.org/10.1137/0215084openalex-snapshot
Completion of a Set of Rules Modulo a Set of Equations
inferred← citeshttps://doi.org/10.7146/brics.v7i13.20140openalex-snapshot
Matching Modulo Associativity and Idempotency is NP-Complete
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.