On the public citation graph
The equivalence of finite valued transducers (on HDTOL languages) is decidable
0 signed · 89 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-07407-4_22openalex-snapshot
Sur les relations rationnelles
inferredcites →https://doi.org/10.1007/978-1-4615-2217-1_1openalex-snapshot
Introduction to Formal Language Theory
inferredcites →https://doi.org/10.1007/978-3-663-09367-1openalex-snapshot
Transductions and Context-Free Languages
inferredcites →https://doi.org/10.1007/bf01744569openalex-snapshot
A note on finite-valued and finitely ambiguous transducers
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/0020-0190(79)90080-2openalex-snapshot
Some decidability results about regular and pushdown translations
inferredcites →https://doi.org/10.1016/0022-0000(78)90002-8openalex-snapshot
On the decidability of homomorphism equivalence for languages
inferredcites →https://doi.org/10.1016/0022-0000(79)90012-6openalex-snapshot
The decidability of equivalence for deterministic finite transducers
inferredcites →https://doi.org/10.1016/0022-0000(80)90013-6openalex-snapshot
Test sets and checking words for homomorphism equivalence
inferredcites →https://doi.org/10.1016/0022-0000(84)90026-6openalex-snapshot
On cancellation properties of languages which are supports of rational power series
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)90068-2openalex-snapshot
Complete problems for deterministic polynomial time
inferredcites →https://doi.org/10.1016/0304-3975(82)90061-5openalex-snapshot
2DST mappings on languages and related problems
inferredcites →https://doi.org/10.1016/0304-3975(84)90004-5openalex-snapshot
The Ehrenfeucht conjecture: a compactness claim for finitely generated free monoids
inferredcites →https://doi.org/10.1016/0304-3975(85)90066-0openalex-snapshot
A proof of Ehrenfeucht's Conjecture
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(86)90171-4openalex-snapshot
Test sets for finite substitutions
inferredcites →https://doi.org/10.1016/s0019-9958(77)90512-5openalex-snapshot
The decidability of the equivalence problem for DOL-systems
inferredcites →https://doi.org/10.1016/s0019-9958(82)80028-4openalex-snapshot
Test sets for context free languages and algebraic systems of equations over a free monoid
inferredcites →https://doi.org/10.1016/s0022-0000(68)80006-6openalex-snapshot
Multitape one-way nonwriting automata
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.1016/s0022-0000(77)80033-0openalex-snapshot
Single-valued a-transducers
inferredcites →https://doi.org/10.1051/ita/1985190302031openalex-snapshot
On the equivalence of compositions of morphisms and inverse morphisms on regular languages
inferredcites →https://doi.org/10.1080/00207168508803465openalex-snapshot
Two-way counter machines and finite-state 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.1137/0211035openalex-snapshot
The Equivalence Problem for Deterministic Two-Way Sequential Transducers is Decidable
inferredcites →https://doi.org/10.1137/0216018openalex-snapshot
The Equivalence Problem for Single-Valued Two-Way Transducers (on NPDTOL Languages) is Decidable
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.1515/9781400882618-006openalex-snapshot
Gedanken-Experiments on Sequential Machines
inferredcites →https://doi.org/10.2307/1971282openalex-snapshot
Finiteness Properties of Matrix Representations
inferredcites →https://doi.org/10.2307/2964500openalex-snapshot
Edward F. Moore. Gedanken-experiments on sequential machines. Automata studies, edited by C. E. Shannon and J. McCarthy, Annals of Mathematics studies no. 34, litho-printed, Princeton University Press, Princeton1956, pp. 129–153.
inferredcites →https://doi.org/10.7146/dpb.v3i33.6453openalex-snapshot
The Mathematical Theory of L Systems
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-45132-3_4openalex-snapshot
Combinatorial and Computational Problems on Finite Sets of Words
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-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-55124-7_12openalex-snapshot
Systems of equations over a finite set of words and automata theory
inferred← citeshttps://doi.org/10.1007/3540185356_28openalex-snapshot
The equivalence of mappings on languages
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-21363-3_1openalex-snapshot
Modular Descriptions of Regular Functions
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-08846-4_16openalex-snapshot
On the Ambiguity, Finite-Valuedness, and Lossiness Problems in Acceptors and 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-23021-4_19openalex-snapshot
Equivalence Checking Problem for Finite State Transducers over Semigroups
inferred← citeshttps://doi.org/10.1007/978-3-319-67089-8_6openalex-snapshot
Copyful Streaming String Transducers
inferred← citeshttps://doi.org/10.1007/978-3-540-31834-7_3openalex-snapshot
Finite Sets of Words and Computing
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-22012-8_1openalex-snapshot
Nondeterministic Streaming String 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-39799-8_41openalex-snapshot
Equivalence of Extended Symbolic Finite Transducers
inferred← citeshttps://doi.org/10.1007/978-3-642-60207-8_9openalex-snapshot
On the Equivalence of Finite Substitutions and Transducers
inferred← citeshttps://doi.org/10.1007/978-3-662-55751-8_3openalex-snapshot
A Tour of Recent Results on Word Transducers
inferred← citeshttps://doi.org/10.1007/bf00264285openalex-snapshot
On the valuedness of finite transducers
inferred← citeshttps://doi.org/10.1007/bf00265153openalex-snapshot
HDTOL matching of computations of multitape automata
inferred← citeshttps://doi.org/10.1007/bf01156601openalex-snapshot
There does not exist an enumerable family of context-free grammars that generates the class of single-valued languages
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/bfb0016289openalex-snapshot
On the degree of ambiguity of finite automata
inferred← citeshttps://doi.org/10.1007/bfb0017179openalex-snapshot
A decomposition theorem for finite-valued transducers and an application to the equivalence problem
inferred← citeshttps://doi.org/10.1007/bfb0029008openalex-snapshot
On the equivalence problem for deterministic multitape automata and transducers
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/0304-3975(91)90381-bopenalex-snapshot
On the degree of ambiguity of finite automata
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.1016/0304-3975(93)90232-iopenalex-snapshot
Equations over finite sets of words and equivalence problems in automata theory
inferred← citeshttps://doi.org/10.1016/0304-3975(93)90289-6openalex-snapshot
On DOL systems with immigration
inferred← citeshttps://doi.org/10.1016/j.ic.2018.02.011openalex-snapshot
Decision problems of tree transducers with origin
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.1080/00207160412331336116openalex-snapshot
The equivalence problem for languages defined by transductions on D0L languages
inferred← citeshttps://doi.org/10.1080/00207168808803611openalex-snapshot
On some transducer equivalence problems for families of languages
inferred← citeshttps://doi.org/10.1109/ics51289.2020.00033openalex-snapshot
On the Valuedness of Symbolic Finite Transducers
inferred← citeshttps://doi.org/10.1134/s0032946015030059openalex-snapshot
Algorithmic aspects of decomposition and equivalence of finite-valued transducers
inferred← citeshttps://doi.org/10.1145/2103621.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.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.18653/v1/w18-5807openalex-snapshot
Modeling Reduplication with 2-way Finite-State Transducers
inferred← citeshttps://doi.org/10.3103/s0146411617070240openalex-snapshot
On the Minimization of Finite State Transducers over Semigroups
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.48550/arxiv.1412.0537openalex-snapshot
On Streaming String Transducers and HDT0L Systems
inferred← citeshttps://doi.org/10.48550/arxiv.1902.06973openalex-snapshot
Equivalence of finite-valued streaming string transducers is decidable
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.