On the public citation graph
Decomposing Finite-Valued Transducers and Deciding Their Equivalence
0 signed · 71 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/3-540-18088-5_12openalex-snapshot
On recent trends in formal language theory
inferredcites →https://doi.org/10.1007/3-540-51486-4_98openalex-snapshot
On the lengths of values in a finite transducer
inferredcites →https://doi.org/10.1007/3-540-52590-4_54openalex-snapshot
Equivalence of finite-valued bottom-up finite state tree transducers is decidable
inferredcites →https://doi.org/10.1007/3540185356_28openalex-snapshot
The equivalence of mappings on languages
inferredcites →https://doi.org/10.1007/978-1-4613-9323-8_19openalex-snapshot
Deciding Code Related Properties by Means of Finite Transducers
inferredcites →https://doi.org/10.1007/978-3-663-09367-1openalex-snapshot
Transductions and Context-Free Languages
inferredcites →https://doi.org/10.1007/bf00264285openalex-snapshot
On the valuedness of finite transducers
inferredcites →https://doi.org/10.1007/bf01068891openalex-snapshot
Equivalence problem for finitely ambiguous finite automata over semigroups
inferredcites →https://doi.org/10.1007/bf01072014openalex-snapshot
Minimal undecidable identity problem for finite-automaton mappings
inferredcites →https://doi.org/10.1007/bf01074660openalex-snapshot
Equivalence problems for finite-automaton mappings into free and commutative semigroups
inferredcites →https://doi.org/10.1007/bf01099355openalex-snapshot
Strict sets and finite semigroup coverings
inferredcites →https://doi.org/10.1007/bf01744569openalex-snapshot
A note on finite-valued and finitely ambiguous transducers
inferredcites →https://doi.org/10.1007/bfb0017179openalex-snapshot
A decomposition theorem for finite-valued transducers and an application to the equivalence problem
inferredcites →https://doi.org/10.1007/bfb0023852openalex-snapshot
Decomposing a k-valued transducer into k unambiguous ones
inferredcites →https://doi.org/10.1016/0022-0000(79)90048-5openalex-snapshot
Equivalence problem of non-deterministic 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/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/0304-3975(90)90189-oopenalex-snapshot
New techniques for proving the decidability of equivalence problems
inferredcites →https://doi.org/10.1016/s0022-0000(77)80033-0openalex-snapshot
Single-valued a-transducers
inferredcites →https://doi.org/10.1080/00207168808803611openalex-snapshot
On some transducer equivalence problems for families of languages
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
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-45465-9_69openalex-snapshot
The Equivalence Problem of Finite Substitutions on ab*c, with Applications
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/978-3-030-13435-8_11openalex-snapshot
Equivalence Checking of Prefix-Free Transducers and Deterministic Two-Tape Automata
inferred← citeshttps://doi.org/10.1007/978-3-030-24886-4_7openalex-snapshot
Characterizing the Valuedness of Two-Way Finite Transducers
inferred← citeshttps://doi.org/10.1007/978-3-319-09704-6_2openalex-snapshot
Automata with Reversal-Bounded Counters: A Survey
inferred← citeshttps://doi.org/10.1007/978-3-319-21500-6_23openalex-snapshot
Multi-Sequential Word Relations
inferred← citeshttps://doi.org/10.1007/978-3-319-23021-4_19openalex-snapshot
Equivalence Checking Problem for Finite State Transducers over Semigroups
inferred← citeshttps://doi.org/10.1007/978-3-319-41579-6_21openalex-snapshot
Equivalence of Finite-Valued Symbolic Finite Transducers
inferred← citeshttps://doi.org/10.1007/978-3-319-98654-8_25openalex-snapshot
A Pattern Logic for Automata with Outputs
inferred← citeshttps://doi.org/10.1007/978-3-540-85238-4_48openalex-snapshot
On the Decidability of Bounded Valuedness for Transducers
inferred← citeshttps://doi.org/10.1007/978-3-540-85780-8_20openalex-snapshot
On the Decidability of the Equivalence for k-Valued Transducers
inferred← citeshttps://doi.org/10.1007/978-3-642-02737-6_39openalex-snapshot
On the Decidability of the Equivalence for a Certain Class of Transducers
inferred← citeshttps://doi.org/10.1007/978-3-642-22256-6_18openalex-snapshot
On the Containment and Equivalence Problems for GSMs, Transducers, and Linear CFGs
inferred← citeshttps://doi.org/10.1007/978-3-642-27660-6_21openalex-snapshot
Visibly Pushdown Transducers with Look-Ahead
inferred← citeshttps://doi.org/10.1007/978-3-642-39799-8_41openalex-snapshot
Equivalence of Extended Symbolic 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/bf01192143openalex-snapshot
Equivalence of finite-valued tree transducers is decidable
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.1007/s00224-009-9206-6openalex-snapshot
Lexicographic Decomposition of k-Valued Transducers
inferred← citeshttps://doi.org/10.1007/s10703-015-0233-4openalex-snapshot
Extended symbolic finite automata and transducers
inferred← citeshttps://doi.org/10.1016/j.ic.2022.104870openalex-snapshot
On the decidability of the valuedness problem for two-way finite transducers
inferred← citeshttps://doi.org/10.1016/j.jcss.2018.05.002openalex-snapshot
Visibly pushdown transducers
inferred← citeshttps://doi.org/10.1016/j.jcss.2025.103731openalex-snapshot
Decomposing finite-valued two-way finite transducers
inferred← citeshttps://doi.org/10.1016/j.tcs.2011.12.034openalex-snapshot
On the containment and equivalence problems for two-way transducers
inferred← citeshttps://doi.org/10.1016/j.tcs.2024.114780openalex-snapshot
On the difference set of two transductions
inferred← citeshttps://doi.org/10.1051/ita/1996300503791openalex-snapshot
Decomposing a $k$-valued transducer into $k$ unambiguous ones
inferred← citeshttps://doi.org/10.1142/9789812794499_0045openalex-snapshot
THE IMPACT OF THE DOL PROBLEM
inferred← citeshttps://doi.org/10.1142/s0129054103001960openalex-snapshot
The Equivalence Problem of Finite Substitutions on ab*c , with Applications
inferred← citeshttps://doi.org/10.1142/s0129054120410038openalex-snapshot
A Pattern Logic for Automata with Outputs
inferred← citeshttps://doi.org/10.1145/2103621.2103674openalex-snapshot
Symbolic finite state transducers
inferred← citeshttps://doi.org/10.1145/2103656.2103674openalex-snapshot
Symbolic finite state transducers
inferred← citeshttps://doi.org/10.1145/2984450.2984453openalex-snapshot
Transducers, logic and algebra for functions of finite words
inferred← citeshttps://doi.org/10.1145/3661814.3662095openalex-snapshot
Finite-valued Streaming String Transducers
inferred← citeshttps://doi.org/10.15514/ispras-2015-27(2)-13openalex-snapshot
Modeling and analysis of the behavior of successive reactive programs
inferred← citeshttps://doi.org/10.15514/ispras-2018-30(3)-21openalex-snapshot
On the model checking of finite state transducers over semigroups
inferred← citeshttps://doi.org/10.18255/1818-1015-2016-6-741-753openalex-snapshot
On the Minimization of Finite State Trans- ducers over Semigroups
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/s0146411617070240openalex-snapshot
On the Minimization of Finite State Transducers over Semigroups
inferred← citeshttps://doi.org/10.3103/s014641162107018xopenalex-snapshot
Efficient Equivalence Checking Technique for Some Classes of Finite-State Machines
inferred← citeshttps://doi.org/10.31144/si.2307-6410.2016.n7.p33-44openalex-snapshot
ON THE MINIMIZATION AND EQUIVALENCE CHECKING OF SEQUENTIAL REACTIVE SYSTEMS
inferred← citeshttps://doi.org/10.3233/fi-2016-1436openalex-snapshot
Visibly Pushdown Automata and Transducers with Counters
inferred← citeshttps://doi.org/10.70675/72be09d6z242fz4778za1c9za96ca334e3dcopenalex-snapshot
Problèmes de bornes pour les automates et les transducteurs à pile visible
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.