On the public citation graph

A decomposition theorem for finite-valued transducers and an application to the equivalence problem

https://doi.org/10.1007/bfb0017179
0 signed · 28 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/3-540-18088-5_12openalex-snapshot
On recent trends in formal language theory
inferredcites →https://doi.org/10.1007/3540185356_28openalex-snapshot
The equivalence of mappings on languages
inferredcites →https://doi.org/10.1007/bf01744569openalex-snapshot
A note on finite-valued and finitely ambiguous transducers
inferredcites →https://doi.org/10.1007/bfb0016250openalex-snapshot
The equivalence of finite valued transducers (on HDTOL languages) is decidable
inferredcites →https://doi.org/10.1007/bfb0016289openalex-snapshot
On the degree of ambiguity of finite automata
inferredcites →https://doi.org/10.1016/0022-0000(81)90028-3openalex-snapshot
The complexity of decision problems for finite-turn multicounter machines
inferredcites →https://doi.org/10.1016/0096-0551(80)90011-9openalex-snapshot
Introduction to automata theory, languages, and computation
inferredcites →https://doi.org/10.1016/0096-0551(80)90068-5openalex-snapshot
Introduction to formal language theory
inferredcites →https://doi.org/10.1016/0304-3975(76)90026-8openalex-snapshot
Sur les relations rationnelles entre monoides libres
inferredcites →https://doi.org/10.1016/0304-3975(86)90134-9openalex-snapshot
The equivalence of finite valued transducers (on HDT0L languages) is decidable
inferredcites →https://doi.org/10.1016/0378-4754(81)90068-9openalex-snapshot
Introduction to automata theory, languages and computation
inferredcites →https://doi.org/10.1016/s0022-0000(77)80033-0openalex-snapshot
Single-valued a-transducers
inferredcites →https://doi.org/10.1109/sfcs.1977.35openalex-snapshot
The unsolvability of the equivalence problem for e-free NGSM's with unary input (output) alphabet and applications
inferredcites →https://doi.org/10.1137/0207042openalex-snapshot
The Unsolvability of the Equivalence Problem for $\varepsilon $-Free NGSM’s with Unary Input (Output) Alphabet and Applications
inferredcites →https://doi.org/10.1145/321466.321473openalex-snapshot
The unsolvability of the Equivalence Problem for Λ-Free nondeterministic generalized machines
inferredcites →https://doi.org/10.5860/choice.26-3305openalex-snapshot
An introduction to formal language theory

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-51486-4_98openalex-snapshot
On the lengths of values in a finite transducer
inferred← citeshttps://doi.org/10.1007/3-540-52590-4_54openalex-snapshot
Equivalence of finite-valued bottom-up finite state tree transducers is decidable
inferred← citeshttps://doi.org/10.1007/3-540-61440-0_130openalex-snapshot
Hard sets method and semilinear reservoir method with applications
inferred← citeshttps://doi.org/10.1007/bf00264285openalex-snapshot
On the valuedness of finite transducers
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.1007/bfb0023852openalex-snapshot
Decomposing a k-valued transducer into k unambiguous ones
inferred← citeshttps://doi.org/10.1016/0304-3975(92)90281-jopenalex-snapshot
Single-valuedness of tree transducers is decidable in polynomial time
inferred← citeshttps://doi.org/10.1134/s0032946015030059openalex-snapshot
Algorithmic aspects of decomposition and equivalence of finite-valued transducers
inferred← citeshttps://doi.org/10.1137/0222014openalex-snapshot
Decomposing Finite-Valued Transducers and Deciding Their Equivalence
inferred← citeshttps://doi.org/10.18255/1818-1015-2020-3-260-303openalex-snapshot
Efficient Equivalence Checking Technique for Some Classes of Finite-State Machines
inferred← citeshttps://doi.org/10.3103/s014641162107018xopenalex-snapshot
Efficient Equivalence Checking Technique for Some Classes of Finite-State Machines
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.