On the public citation graph

Locally testable semigroups

https://doi.org/10.1007/bf02572893
0 signed · 48 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/bf02416940openalex-snapshot
Demi-groupes réguliers
inferredcites →https://doi.org/10.1007/bf02760257openalex-snapshot
Decomposition theorems for finite sequential machines
inferredcites →https://doi.org/10.1016/s0022-0000(72)80020-5openalex-snapshot
Locally testable languages
inferredcites →https://doi.org/10.1090/s0002-9947-1971-0283104-2openalex-snapshot
Studies in the Representation Theory of Finite Semigroups
inferredcites →https://doi.org/10.1215/s0012-7094-44-01101-4openalex-snapshot
Unending chess, symbolic dynamics and a problem in semigroups
inferredcites →https://doi.org/10.2140/pjm.1958.8.257openalex-snapshot
The structure of idempotent semigroups. I
inferredcites →https://doi.org/10.2307/2004410openalex-snapshot
Algebraic Theory of Machines, Languages, and Semigroups

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-07854-1_205openalex-snapshot
Semigroup characterizations of some language varieties
inferred← citeshttps://doi.org/10.1007/3-540-10003-2_86openalex-snapshot
On some properties of local 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/bf01761708openalex-snapshot
Algebraic decision procedures for local testability
inferred← citeshttps://doi.org/10.1007/bf01897107openalex-snapshot
Regular locally testable semigroups as semigroups of quasi-ideals
inferred← citeshttps://doi.org/10.1007/bf02572744openalex-snapshot
The varieties of n-testable semigroups
inferred← citeshttps://doi.org/10.1007/bf02572763openalex-snapshot
Local semilattices on two generators
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.1007/bfb0087128openalex-snapshot
Semi-groups lineaires de rang borne Decidabilite de la finitude
inferred← citeshttps://doi.org/10.1007/s00012-018-0481-4openalex-snapshot
Representation of normal bands as semigroups of k-bi-ideals of a semiring
inferred← citeshttps://doi.org/10.1007/s13370-023-01072-6openalex-snapshot
On minimal bi-ideal elements of an le-semigroup
inferred← citeshttps://doi.org/10.1016/0021-8693(75)90184-2openalex-snapshot
The Burnside problem for semigroups
inferred← citeshttps://doi.org/10.1016/0021-8693(78)90249-1openalex-snapshot
La finitude des représentations linéaires des semi-groupes est décidable
inferred← citeshttps://doi.org/10.1016/0304-3975(77)90006-8openalex-snapshot
UN algorithme calculant le cardinal, fini ou infini, des demi-groupes de matrices
inferred← citeshttps://doi.org/10.1016/0304-3975(95)00100-xopenalex-snapshot
Over testable languages
inferred← citeshttps://doi.org/10.1016/b978-0-12-319450-3.50011-6openalex-snapshot
CONSTRUCTING BIORDERED SETS
inferred← citeshttps://doi.org/10.1016/j.jpaa.2006.06.016openalex-snapshot
Pseudovarieties defining classes of sofic subshifts closed under taking shift equivalent subshifts
inferred← citeshttps://doi.org/10.1016/j.jpaa.2008.08.009openalex-snapshot
Infinite-vertex free profinite semigroupoids and symbolic dynamics
inferred← citeshttps://doi.org/10.1016/j.tcs.2008.04.043openalex-snapshot
On bases of identities for the ω -variety generated by locally testable semigroups
inferred← citeshttps://doi.org/10.1016/s0019-9958(80)90180-1openalex-snapshot
A characterization of strictly locally testable languages and its application to subsemigroups of a free semigroup
inferred← citeshttps://doi.org/10.1016/s0022-0000(72)80020-5openalex-snapshot
Locally testable languages
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/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/s0013091500003801openalex-snapshot
The natural partial order on a regular semigroup
inferred← citeshttps://doi.org/10.1017/s0305004100076179openalex-snapshot
The word problem for the bifree combinatorial strict regular semigroup
inferred← citeshttps://doi.org/10.1051/ita/197610r200331openalex-snapshot
Hierarchies of aperiodic languages
inferred← citeshttps://doi.org/10.1051/ita/1980140100391openalex-snapshot
On some properties of the syntactic semigroup of a very pure subsemigroup
inferred← citeshttps://doi.org/10.1051/ita:1999105openalex-snapshot
Strongly locally testable semigroups with commuting idempotents and related languages
inferred← citeshttps://doi.org/10.1080/00927872.2021.1931263openalex-snapshot
The Karoubi envelope of the mirage of a subshift
inferred← citeshttps://doi.org/10.1080/00927879908826762openalex-snapshot
Identities of locally testable semigroups
inferred← citeshttps://doi.org/10.1090/s0002-9947-1982-0667165-1openalex-snapshot
The Structure of Pseudo-Inverse Semigroups
inferred← citeshttps://doi.org/10.1109/lics52264.2021.9470660openalex-snapshot
An Algebraic Characterisation of First-Order Logic with Neighbour
inferred← citeshttps://doi.org/10.1142/s0218196712500609openalex-snapshot
TAMENESS OF JOINS INVOLVING THE PSEUDOVARIETY OF LOCAL SEMILATTICES
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.4153/cjm-1986-039-1openalex-snapshot
A Semigroup Approach to Linear Algebraic Groups III. Buildings
inferred← citeshttps://doi.org/10.46793/kgjmat2303openalex-snapshot
inferred← citeshttps://doi.org/10.46793/kgjmat2303.339mopenalex-snapshot
On the Semigroup of Bi-Ideals of an Ordered Semigroup
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.48550/arxiv.2106.02312openalex-snapshot
Verification Tools 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.