On the public citation graph

Word Problem of the Perkins Semigroup via Directed Acyclic Graphs

https://doi.org/10.1007/s11083-008-9083-7
0 signed · 71 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.1006/jsco.1993.1004openalex-snapshot
The Equivalence Problem for Finite Rings
inferredcites →https://doi.org/10.1007/s00012-004-1873-1openalex-snapshot
The complexity of checking identities for finite matrix rings
inferredcites →https://doi.org/10.1007/s00012-004-1895-8openalex-snapshot
Results on the equivalence problem for finite groups
inferredcites →https://doi.org/10.1007/s000120050132openalex-snapshot
Congruence modular varieties with small free spectra
inferredcites →https://doi.org/10.1007/s00233-005-0510-4openalex-snapshot
Computational Complexity of Checking Identities in 0-Simple Semigroups and Matrix Semigroups over Finite Fields
inferredcites →https://doi.org/10.1007/s00233-006-0672-8openalex-snapshot
Asymptotic Growth of Free Spectra of Band Monoids
inferredcites →https://doi.org/10.1007/s00233-009-9180-yopenalex-snapshot
Complexity issues of checking identities in finite monoids
inferredcites →https://doi.org/10.1007/s11225-005-0356-5openalex-snapshot
Checking quasi-identities in a finite semigroup may be computationally hard
inferredcites →https://doi.org/10.1016/0021-8693(69)90058-1openalex-snapshot
Bases for equational theories of semigroups
inferredcites →https://doi.org/10.1016/j.jpaa.2007.09.008openalex-snapshot
Monoids with sub-log-exponential free spectra
inferredcites →https://doi.org/10.1090/s0002-9939-04-07488-xopenalex-snapshot
The complexity of the word-problem for finite matrix rings
inferredcites →https://doi.org/10.1093/qmath/14.1.46openalex-snapshot
SOME INDECOMPOSABLE VARIETIES OF GROUPS
inferredcites →https://doi.org/10.1112/blms/bdm030openalex-snapshot
The complexity of the equivalence problem for nonsolvable groups
inferredcites →https://doi.org/10.1112/jlms/s2-39.1.102openalex-snapshot
Free Combinatorial Strict Inverse Semigroups
inferredcites →https://doi.org/10.1142/s0218196704001840openalex-snapshot
COMPLEXITY OF SEMIGROUP IDENTITY CHECKING
inferredcites →https://doi.org/10.1142/s0218196705002293openalex-snapshot
THE PERKINS SEMIGROUP HAS CO-NP-COMPLETE TERM-EQUIVALENCE PROBLEM
inferredcites →https://doi.org/10.25596/jalc-2008-045openalex-snapshot
On Representable Graphs
inferredcites →https://doi.org/10.4153/cjm-1990-058-9openalex-snapshot
Free Objects in Certain Varieties of Inverse Semigroups

What points at this work

Incoming claims: where this work appears in other papers’ reference lists and arguments.

inferred← citeshttps://doi.org/10.2139/ssrn.4494880openalex-extracted
The ℓ-Rauzy Graphs on Infinite Words
inferred← citeshttps://doi.org/10.2139/ssrn.5375907openalex-extracted
Word-Representability of Co-Bipartite Graphs
inferred← citeshttps://doi.org/10.1007/978-3-030-28796-2_14openalex-snapshot
Enumeration and Extensions of Word-Representants
inferred← citeshttps://doi.org/10.1007/978-3-031-33264-7_13openalex-snapshot
On Word-Representable and Multi-word-Representable Graphs
inferred← citeshttps://doi.org/10.1007/978-3-031-52113-3_18openalex-snapshot
Word-Representable Graphs from a Word’s Perspective
inferred← citeshttps://doi.org/10.1007/978-3-032-17156-6_15openalex-snapshot
On the Word-Representability of 5-Regular Circulant Graphs
inferred← citeshttps://doi.org/10.1007/978-3-032-17156-6_19openalex-snapshot
On Word-Representability of Minimal Non-comparability Graphs
inferred← citeshttps://doi.org/10.1007/978-3-032-28404-4_16openalex-snapshot
On Languages Describing Large Graph Classes
inferred← citeshttps://doi.org/10.1007/978-3-319-25859-1_6openalex-snapshot
Representing Graphs via Pattern-Avoiding Words
inferred← citeshttps://doi.org/10.1007/978-3-319-62809-7_2openalex-snapshot
A Comprehensive Introduction to the Theory of Word-Representable Graphs
inferred← citeshttps://doi.org/10.1007/978-3-642-14455-4_41openalex-snapshot
Graphs Capturing Alternations in Words
inferred← citeshttps://doi.org/10.1007/978-3-642-22321-1_46openalex-snapshot
On the Representability of Line Graphs
inferred← citeshttps://doi.org/10.1007/978-3-642-25870-1_18openalex-snapshot
Alternation Graphs
inferred← citeshttps://doi.org/10.1007/978-981-95-1853-1_22openalex-snapshot
The Representation Number and the prn of Stacked Book Graphs
inferred← citeshttps://doi.org/10.1007/s00236-022-00427-zopenalex-snapshot
Properties of graphs specified by a regular language
inferred← citeshttps://doi.org/10.1007/s00236-024-00462-yopenalex-snapshot
Word-representable graphs from a word’s perspective
inferred← citeshttps://doi.org/10.1007/s00236-026-00547-wopenalex-snapshot
On the representation number of chessboard graphs
inferred← citeshttps://doi.org/10.1007/s00373-016-1693-zopenalex-snapshot
Word-Representability of Face Subdivisions of Triangular Grid Graphs
inferred← citeshttps://doi.org/10.1007/s00373-025-03000-wopenalex-snapshot
Square-free Word-representation of Word-representable Graphs
inferred← citeshttps://doi.org/10.1007/s00373-026-03029-5openalex-snapshot
Word-Representation of Melon Graphs
inferred← citeshttps://doi.org/10.1007/s10878-018-0358-7openalex-snapshot
On operations preserving semi-transitive orientability of graphs
inferred← citeshttps://doi.org/10.1007/s11786-016-0257-1openalex-snapshot
Structural Properties of Word Representable Graphs
inferred← citeshttps://doi.org/10.1016/j.aam.2019.02.009openalex-snapshot
Some results on Parikh word representable graphs and partitions
inferred← citeshttps://doi.org/10.1016/j.dam.2014.10.024openalex-snapshot
New results on word-representable graphs
inferred← citeshttps://doi.org/10.1016/j.dam.2015.07.033openalex-snapshot
Semi-transitive orientations and word-representable graphs
inferred← citeshttps://doi.org/10.1016/j.dam.2016.05.025openalex-snapshot
Word-representability of triangulations of grid-covered cylinder graphs
inferred← citeshttps://doi.org/10.1016/j.dam.2018.03.013openalex-snapshot
On the representation number of a crown graph
inferred← citeshttps://doi.org/10.1016/j.dam.2019.07.013openalex-snapshot
Word-representability of Toeplitz graphs
inferred← citeshttps://doi.org/10.1016/j.dam.2020.03.063openalex-snapshot
Enumeration and extensions of word-representants
inferred← citeshttps://doi.org/10.1016/j.dam.2023.10.021openalex-snapshot
Minimum length word-representants of word-representable graphs
inferred← citeshttps://doi.org/10.1016/j.dam.2024.06.022openalex-snapshot
Word-representability of graphs with respect to split recomposition
inferred← citeshttps://doi.org/10.1016/j.dam.2024.07.002openalex-snapshot
Minimum length word-representants of graph products
inferred← citeshttps://doi.org/10.1016/j.dam.2025.05.021openalex-snapshot
Multi-word-representability of graphs
inferred← citeshttps://doi.org/10.1016/j.dam.2025.08.025openalex-snapshot
On semi-transitive orientability of circulant graphs
inferred← citeshttps://doi.org/10.1016/j.disc.2020.111909openalex-snapshot
On semi-transitive orientability of Kneser graphs and their complements
inferred← citeshttps://doi.org/10.1016/j.jalgebra.2015.03.015openalex-snapshot
The complexity of the equivalence and equation solvability problems over meta-Abelian groups
inferred← citeshttps://doi.org/10.1016/j.jpaa.2007.09.008openalex-snapshot
Monoids with sub-log-exponential free spectra
inferred← citeshttps://doi.org/10.1017/s0013091525101211openalex-snapshot
k -11-representations of graphs, revisited
inferred← citeshttps://doi.org/10.1017/s1446788712000407openalex-snapshot
ON FREE SPECTRA OF A CLASS OF FINITE INVERSE MONOIDS
inferred← citeshttps://doi.org/10.1134/s1990478918020084openalex-snapshot
Word-Representable Graphs: a Survey
inferred← citeshttps://doi.org/10.1134/s1990478924040161openalex-snapshot
The $$ \ell $$-Rauzy Graphs on Infinite Words
inferred← citeshttps://doi.org/10.1515/puma-2015-0032openalex-snapshot
Colourability and word-representability of near-triangulations
inferred← citeshttps://doi.org/10.2139/ssrn.4880403openalex-snapshot
Word Representation of Corona Product of Graphs
inferred← citeshttps://doi.org/10.25596/jalc-2013-097openalex-snapshot
On Graphs With Representation Number 3
inferred← citeshttps://doi.org/10.37236/4946openalex-snapshot
Representing Graphs via Pattern Avoiding Words
inferred← citeshttps://doi.org/10.4236/ojdm.2011.12012openalex-snapshot
Word-Representability of Line Graphs
inferred← citeshttps://doi.org/10.4310/joc.2019.v10.n3.a3openalex-snapshot
On $k\textrm{-}11$-representable graphs
inferred← citeshttps://doi.org/10.4310/joc.2021.v12.n4.a6openalex-snapshot
Word-representability of split graphs
inferred← citeshttps://doi.org/10.48550/arxiv.1705.05924openalex-snapshot
A Comprehensive Introduction to the Theory of Word-Representable Graphs
inferred← citeshttps://doi.org/10.48550/arxiv.1903.02777openalex-snapshot
On semi-transitive orientability of Kneser graphs and their complements
inferred← citeshttps://doi.org/10.48550/arxiv.2109.03458openalex-snapshot
On the Representation Number of Bipartite Graphs
inferred← citeshttps://doi.org/10.54550/eca2023v3s1h1openalex-snapshot
The history of the Gothenburg--Reykjavík--Strathclyde combinatorics group
inferred← citeshttps://doi.org/10.82444/warw.33754960openalex-snapshot
Graph parameters and the speed of hereditary properties
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.