On the public citation graph

The varieties of n-testable semigroups

https://doi.org/10.1007/bf02572744
0 signed · 24 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.1007/bf01761708openalex-snapshot
Algebraic decision procedures for local testability
inferredcites →https://doi.org/10.1007/bf01897107openalex-snapshot
Regular locally testable semigroups as semigroups of quasi-ideals
inferredcites →https://doi.org/10.1007/bf02572893openalex-snapshot
Locally testable semigroups
inferredcites →https://doi.org/10.1016/s0012-365x(73)80005-6openalex-snapshot
Characterizations of locally testable events
inferredcites →https://doi.org/10.1016/s0022-0000(72)80020-5openalex-snapshot
Locally testable languages
inferredcites →https://doi.org/10.1016/s0079-8169(08)x6055-6openalex-snapshot
Automata, Languages, and Machines
inferredcites →https://doi.org/10.1017/s003060530001721xopenalex-snapshot
Butterfly Watching by Whalley Paul. Severn House, £7.95.

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-44977-9_22openalex-snapshot
A Package TESTAS for Checking Some Kinds of Testability
inferred← citeshttps://doi.org/10.1007/3-540-45526-4_15openalex-snapshot
An Algorithm to Verify Local Threshold Testability of Deterministic Finite Automata
inferred← citeshttps://doi.org/10.1007/bf02573687openalex-snapshot
Identities of a five-element 0-simple semigroup
inferred← citeshttps://doi.org/10.1007/bf02773226openalex-snapshot
Finite aperiodic semigroups with commuting idempotents and generalizations
inferred← citeshttps://doi.org/10.1007/bfb0031393openalex-snapshot
Precise estimation of the order of local testability of a deterministic finite automaton
inferred← citeshttps://doi.org/10.1016/0022-4049(89)90124-2openalex-snapshot
Semidirect products of pseudovarieties from the universal algebraist's point of view
inferred← citeshttps://doi.org/10.1016/s0022-4049(00)00176-6openalex-snapshot
Free profinite locally idempotent and locally commutative semigroups
inferred← citeshttps://doi.org/10.1016/s0022-4049(98)00162-5openalex-snapshot
On finitely based pseudovarieties of the forms V∗D and V∗Dn
inferred← citeshttps://doi.org/10.1016/s0304-3975(99)00017-1openalex-snapshot
Optimal estimation on the order of local testability of finite automata
inferred← citeshttps://doi.org/10.1016/s0304-3975(99)00191-7openalex-snapshot
Algorithms finding the order of local testability of deterministic finite automaton and estimations of the order
inferred← citeshttps://doi.org/10.1017/s0017089511000188openalex-snapshot
ON FREE SPECTRA OF LOCALLY TESTABLE SEMIGROUP VARIETIES
inferred← citeshttps://doi.org/10.1017/s0305004100076179openalex-snapshot
The word problem for the bifree combinatorial strict regular semigroup
inferred← citeshttps://doi.org/10.1080/00927879908826762openalex-snapshot
Identities of locally testable semigroups
inferred← citeshttps://doi.org/10.1142/s0218196799000035openalex-snapshot
A POLYNOMIAL TIME ALGORITHM FOR LOCAL TESTABILITY AND ITS LEVEL
inferred← citeshttps://doi.org/10.1201/9780203009642.ch34openalex-snapshot
The Identities of Local Threshold Testability
inferred← citeshttps://doi.org/10.48550/arxiv.2011.06253openalex-snapshot
Precise estimation on the order of local testability of deterministic finite automaton
inferred← citeshttps://doi.org/10.5555/1756384.1756408openalex-snapshot
A package TESTAS for checking some kinds of testability
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.