On the public citation graph
On the defect theorem and simplifiability
0 signed · 46 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/bf02194675openalex-snapshot
Presentations et presentations simplifiables d'un monoïde simplifiable
inferredcites →https://doi.org/10.1007/bf02194863openalex-snapshot
Quelques Constructions Et Algorithmes Relatifs Aux Sous-Monoïdes D'un Monoïde Libre
inferredcites →https://doi.org/10.1007/bf02570808openalex-snapshot
The intersection of free submonoids of a free monoid is free
inferredcites →https://doi.org/10.1007/bf02572484openalex-snapshot
Some algorithms on the star operation applied to finite languages
inferredcites →https://doi.org/10.1007/bf02572962openalex-snapshot
On finitely generated subsemigroups of a free semigroup
inferredcites →https://doi.org/10.1007/bf02573324openalex-snapshot
A note on intersections of free submonoids of a free monoid
inferredcites →https://doi.org/10.1007/bfb0012763openalex-snapshot
On test sets and the Ehrenfeucht conjecture
inferredcites →https://doi.org/10.1016/0012-365x(83)90152-8openalex-snapshot
Systems of equations over a free monoid and Ehrenfeucht's conjecture
inferredcites →https://doi.org/10.1016/0021-8693(79)90113-3openalex-snapshot
Sur le théorème du défaut
inferredcites →https://doi.org/10.1016/0304-3975(78)90047-6openalex-snapshot
Elementary homomorphisms and a solution of the D0L sequence equivalence problem
inferredcites →https://doi.org/10.1016/0304-3975(85)90066-0openalex-snapshot
A proof of Ehrenfeucht's Conjecture
inferredcites →https://doi.org/10.1016/b978-0-7204-0725-9.50042-3openalex-snapshot
REMARKS ON FULLY INVARIANT CONGRUENCES
inferredcites →https://doi.org/10.1080/00207167708803132openalex-snapshot
The decidability of the dol prefix problem
inferredcites →https://doi.org/10.1112/blms/12.3.230bopenalex-snapshot
SEMIGROUPS AND COMBINATORIAL APPLICATIONS
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-18088-5_12openalex-snapshot
On recent trends in formal language theory
inferred← citeshttps://doi.org/10.1007/3-540-54458-5_80openalex-snapshot
On the subsets of rank two in a free monoid: A fast decision algorithm
inferred← citeshttps://doi.org/10.1007/3-540-56730-5_38openalex-snapshot
On the subsets of rank two in a free monoid: A fast decision algorithm
inferred← citeshttps://doi.org/10.1007/3-540-58131-6_43openalex-snapshot
Identities and transductions
inferred← citeshttps://doi.org/10.1007/3-540-60084-1_95openalex-snapshot
Compactness of systems of equations in semigroups
inferred← citeshttps://doi.org/10.1007/978-3-030-28796-2_3openalex-snapshot
On Sets of Words of Rank Two
inferred← citeshttps://doi.org/10.1007/bf02573374openalex-snapshot
On the deficit of a finite set of words
inferred← citeshttps://doi.org/10.1007/bfb0055818openalex-snapshot
On defect effect of bi-infinite words
inferred← citeshttps://doi.org/10.1007/bfb0083421openalex-snapshot
Systems of equations over a finitely generated free monoid having an effectively findable equivalent finite subsystem
inferred← citeshttps://doi.org/10.1007/s00012-008-2084-yopenalex-snapshot
A class of inherently nonfinitely based semirings
inferred← citeshttps://doi.org/10.1007/s00224-004-1191-1openalex-snapshot
Commutation with Ternary Sets of Words
inferred← citeshttps://doi.org/10.1016/0166-218x(88)90072-8openalex-snapshot
A defect property of codes with unbounded delays
inferred← citeshttps://doi.org/10.1016/0304-3975(92)90350-oopenalex-snapshot
On the rank of the subsets of a free monoid
inferred← citeshttps://doi.org/10.1016/0304-3975(93)90023-mopenalex-snapshot
Deciding whether a finite set of words has rank at most two
inferred← citeshttps://doi.org/10.1016/j.jda.2015.03.006openalex-snapshot
An algorithm for enumerating all infinite repetitions in a D0L-system
inferred← citeshttps://doi.org/10.1016/j.tcs.2004.03.051openalex-snapshot
Many aspects of defect theorems
inferred← citeshttps://doi.org/10.1016/j.tcs.2021.11.024openalex-snapshot
The intersection of 3-maximal submonoids
inferred← citeshttps://doi.org/10.1016/s0304-3975(00)00435-7openalex-snapshot
Multiple factorizations of words and defect effect
inferred← citeshttps://doi.org/10.1016/s0304-3975(01)00225-0openalex-snapshot
A defect theorem for bi-infinite words
inferred← citeshttps://doi.org/10.1016/s0304-3975(96)00311-8openalex-snapshot
A note on decidability questions on presentations of word semigroups
inferred← citeshttps://doi.org/10.1142/9789812562494_0059openalex-snapshot
COMBINATORICS ON WORDS – A TUTORIAL
inferred← citeshttps://doi.org/10.1142/s0129054107005030openalex-snapshot
ON NON-PERIODIC SOLUTIONS OF INDEPENDENT SYSTEMS OF WORD EQUATIONS OVER THREE UNKNOWNS
inferred← citeshttps://doi.org/10.14232/actacyb.22.2.2015.3openalex-snapshot
Methods for Relativizing Properties of Codes
inferred← citeshttps://doi.org/10.46298/dmtcs.279openalex-snapshot
Defect Effect of Bi-infinite Words in the Two-element Case
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.