On the public citation graph

On the topological structure of a finitely generated semigroup of matrices

https://doi.org/10.1007/bf02573140
0 signed · 33 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.1016/0021-8693(75)90184-2openalex-snapshot
The Burnside problem for semigroups
inferredcites →https://doi.org/10.1016/0021-8693(78)90249-1openalex-snapshot
La finitude des représentations linéaires des semi-groupes est décidable
inferredcites →https://doi.org/10.1016/0022-0000(82)90051-4openalex-snapshot
Limitedness theorem on finite automata with distance functions
inferredcites →https://doi.org/10.1016/0304-3975(77)90001-9openalex-snapshot
On finite semigroups of matrices
inferredcites →https://doi.org/10.1016/0304-3975(88)90012-6openalex-snapshot
On the finite-valuedness problem for sequential machines
inferredcites →https://doi.org/10.1109/sfcs.1978.21openalex-snapshot
Limited subsets of a free monoid
inferredcites →https://doi.org/10.1112/blms/12.3.230bopenalex-snapshot
SEMIGROUPS AND COMBINATORIAL APPLICATIONS
inferredcites →https://doi.org/10.2140/pjm.1971.36.285openalex-snapshot
An interesting combinatorial method in the theory of locally finite semigroups
inferredcites →https://doi.org/10.2307/1969317openalex-snapshot
On the Structure of 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-55808-x_34openalex-snapshot
On finite automata with limited nondeterminism (extended abstract)
inferred← citeshttps://doi.org/10.1007/3-540-56939-1_92openalex-snapshot
The product of rational languages
inferred← citeshttps://doi.org/10.1007/3-540-61440-0_139openalex-snapshot
New upper bounds to the limitedness of distance automata
inferred← citeshttps://doi.org/10.1007/978-3-642-31585-5_35openalex-snapshot
Languages of Profinite Words and the Limitedness Problem
inferred← citeshttps://doi.org/10.1007/bf02574104openalex-snapshot
On the burnside problem for semigroups of matrices in the (max,+) algebra
inferred← citeshttps://doi.org/10.1007/bf02676609openalex-snapshot
On the burnside problem for semigroups of matrices in the (max, +) algebra
inferred← citeshttps://doi.org/10.1007/s00224-005-1255-xopenalex-snapshot
A Burnside Approach to the Finite Substitution Problem
inferred← citeshttps://doi.org/10.1007/s00224-015-9643-3openalex-snapshot
Approximate Comparison of Functions Computed by Distance Automata
inferred← citeshttps://doi.org/10.1016/0304-3975(91)90321-ropenalex-snapshot
Limitedness theorem on finite automata with distance functions: an algebraic proof
inferred← citeshttps://doi.org/10.1016/0890-5401(90)90053-kopenalex-snapshot
On measuring nondeterminism in regular languages
inferred← citeshttps://doi.org/10.1016/s0304-3975(02)00864-2openalex-snapshot
Equational theories of tropical semirings
inferred← citeshttps://doi.org/10.1016/s0304-3975(03)00377-3openalex-snapshot
The limitedness problem on distance automata: Hashiguchi's method revisited
inferred← citeshttps://doi.org/10.1016/s0304-3975(97)00260-0openalex-snapshot
New upper bounds to the limitedness of distance automata
inferred← citeshttps://doi.org/10.1051/ita/1994283-402771openalex-snapshot
On semigroups of matrices over the tropical semiring
inferred← citeshttps://doi.org/10.1051/ita:2005027openalex-snapshot
Distance desert automata and the star height problem
inferred← citeshttps://doi.org/10.1109/lics56636.2023.10175798openalex-snapshot
The Big-O Problem for Max-Plus Automata is Decidable (PSPACE-Complete)
inferred← citeshttps://doi.org/10.1145/2603088.2603104openalex-snapshot
Two-way cost automata and cost logics over infinite trees
inferred← citeshttps://doi.org/10.1145/2933575.2934502openalex-snapshot
Games with bound guess actions
inferred← citeshttps://doi.org/10.13130/guillon-bruno_phd2016-05-30openalex-snapshot
Two-wayness: Automata and Transducers
inferred← citeshttps://doi.org/10.2168/lmcs-9(3:3)2013openalex-snapshot
Regular Cost Functions, Part I: Logic and Algebra over Words
inferred← citeshttps://doi.org/10.25596/jalc-2002-321openalex-snapshot
Semiring Frameworks and Algorithms for Shortest-Distance Problems
inferred← citeshttps://doi.org/10.4230/lipics.stacs.2013.574openalex-snapshot
Approximate comparison of distance automata
inferred← citeshttps://doi.org/10.46298/lmcs-21(3:3)2025openalex-snapshot
The Big-O Problem for Max-Plus Automata is Decidable (PSPACE-Complete)
inferred← citeshttps://doi.org/10.7146/brics.v8i21.21682openalex-snapshot
Equational Theories of Tropical Semirings
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.