On the public citation graph
Equivalence problems for finite-automaton mappings into free and commutative semigroups
0 signed · 21 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/bf01069939openalex-snapshot
Generalized finite generators and identity problems in definitive algebras of regular events
inferredcites →https://doi.org/10.1007/bf01071369openalex-snapshot
Identity problem for quasiregular algebras over commutative semigroups and commutative semigroups of languages
inferredcites →https://doi.org/10.1007/bf01073302openalex-snapshot
Identity problem for the algebra of regular events over semigroups
inferredcites →https://doi.org/10.1007/bf01641495openalex-snapshot
Decision problems for graph schemata with commutable operators. Part II
inferredcites →https://doi.org/10.1016/0020-0271(67)90007-1openalex-snapshot
The mathematical theory of context-free languages
inferredcites →https://doi.org/10.1016/s0022-0000(73)80045-5openalex-snapshot
The equivalence problem for deterministic two-tape automata
inferredcites →https://doi.org/10.1070/rm1961v016n05abeh004112openalex-snapshot
THE ABSTRACT THEORY OF AUTOMATA
inferredcites →https://doi.org/10.1109/t-c.1975.224294openalex-snapshot
A Remark on Code Sets and Context-Free Languages
inferredcites →https://doi.org/10.1145/321466.321473openalex-snapshot
The unsolvability of the Equivalence Problem for Λ-Free nondeterministic generalized machines
What points at this work
Incoming claims: where this work appears in other papers’ reference lists and arguments.
inferred← citeshttps://doi.org/10.1007/978-1-4613-9323-8_19openalex-snapshot
Deciding Code Related Properties by Means of Finite Transducers
inferred← citeshttps://doi.org/10.1007/bf00264285openalex-snapshot
On the valuedness of finite transducers
inferred← citeshttps://doi.org/10.1007/bf01068773openalex-snapshot
Finite-automaton semigroup mappings
inferred← citeshttps://doi.org/10.1007/bf01068891openalex-snapshot
Equivalence problem for finitely ambiguous finite automata over semigroups
inferred← citeshttps://doi.org/10.1007/bf01069831openalex-snapshot
Finite-automata mappings in a partially commutative semigroup
inferred← citeshttps://doi.org/10.1007/bf01070121openalex-snapshot
Algorithmic solvability of comparison problems for finitely ambiguous sequence transducers on superwords
inferred← citeshttps://doi.org/10.1007/bf01132781openalex-snapshot
Problems of inclusion and equivalence for program schemata and formal languages
inferred← citeshttps://doi.org/10.1007/bf01185566openalex-snapshot
On the lengths of values in a finite transducer
inferred← citeshttps://doi.org/10.1007/bf02733064openalex-snapshot
Finitely many-valued regular events in a direct product of semigroups
inferred← citeshttps://doi.org/10.1137/0222014openalex-snapshot
Decomposing Finite-Valued Transducers and Deciding Their Equivalence
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.