On the public citation graph

The Equivalence Problem for Deterministic Two-Way Sequential Transducers is Decidable

https://doi.org/10.1137/0211035
0 signed · 50 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/0022-0000(79)90049-7openalex-snapshot
Some decision problems concerning sequential transducers and checking automata
inferredcites →https://doi.org/10.1016/s0019-9958(71)90483-9openalex-snapshot
Two-way sequential transductions and stack automata
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.1145/322047.322058openalex-snapshot
Reversal-Bounded Multicounter Machines and Their Decision Problems

What points at this work

Incoming claims: where this work appears in other papers’ reference lists and arguments.

inferred← citeshttps://doi.org/10.1007/11590156_40openalex-snapshot
The Equivalence Problem for Deterministic MSO Tree Transducers Is Decidable
inferred← citeshttps://doi.org/10.1007/3-540-19488-6_114openalex-snapshot
New techniques for proving the decidability of equivalence problems
inferred← citeshttps://doi.org/10.1007/3540185356_28openalex-snapshot
The equivalence of mappings on languages
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-030-79121-6openalex-snapshot
Implementation and Application of Automata
inferred← citeshttps://doi.org/10.1007/978-3-031-30829-1_21openalex-snapshot
Pebble minimization: the last theorems
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-642-21254-3_28openalex-snapshot
Normalization of Sequential Top-Down Tree-to-Word Transducers
inferred← citeshttps://doi.org/10.1007/978-3-642-22321-1_26openalex-snapshot
On Two-Way Transducers
inferred← citeshttps://doi.org/10.1007/978-3-642-29344-3_44openalex-snapshot
Oblivious Two-Way Finite Automata: Decidability and Complexity
inferred← citeshttps://doi.org/10.1007/978-3-642-31653-1_24openalex-snapshot
Two-Way Transducers with a Two-Way Output Tape
inferred← citeshttps://doi.org/10.1007/978-3-642-37064-9_48openalex-snapshot
Uniformisation of Two-Way Transducers
inferred← citeshttps://doi.org/10.1007/978-3-642-38592-6_15openalex-snapshot
Transducer-Based Algorithmic Verification of Retransmission Protocols over Noisy Channels
inferred← citeshttps://doi.org/10.1007/978-3-662-43951-7_3openalex-snapshot
Transducers with Origin Information
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/bfb0016250openalex-snapshot
The equivalence of finite valued transducers (on HDTOL languages) is decidable
inferred← citeshttps://doi.org/10.1007/s10470-013-0228-2openalex-snapshot
Waveform reconstruction from ontological description
inferred← citeshttps://doi.org/10.1016/0304-3975(84)90018-5openalex-snapshot
Hierarchies of primitive recursive wordsequence functions: Comparisons and decision problems
inferred← citeshttps://doi.org/10.1016/0304-3975(86)90134-9openalex-snapshot
The equivalence of finite valued transducers (on HDT0L languages) is decidable
inferred← citeshttps://doi.org/10.1016/0304-3975(90)90189-oopenalex-snapshot
New techniques for proving the decidability of equivalence problems
inferred← citeshttps://doi.org/10.1016/0890-5401(87)90012-5openalex-snapshot
The Dyck language D'1∗ is not generated by any matrix grammar of finite index
inferred← citeshttps://doi.org/10.1016/j.ic.2015.02.001openalex-snapshot
Normality and two-way automata
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.ipl.2006.05.015openalex-snapshot
The equivalence problem for deterministic MSO tree transducers is decidable
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.2016.05.004openalex-snapshot
Sequences of words defined by two-way transducers
inferred← citeshttps://doi.org/10.1080/00207168508803465openalex-snapshot
Two-way counter machines and finite-state transducers†
inferred← citeshttps://doi.org/10.1080/00207168808803611openalex-snapshot
On some transducer equivalence problems for families of languages
inferred← citeshttps://doi.org/10.1109/lics56636.2023.10175796openalex-snapshot
Folding interpretations
inferred← citeshttps://doi.org/10.1137/0216018openalex-snapshot
The Equivalence Problem for Single-Valued Two-Way Transducers (on NPDTOL Languages) is Decidable
inferred← citeshttps://doi.org/10.1142/s0129054115400134openalex-snapshot
A Survey on Decidable Equivalence Problems for Tree Transducers
inferred← citeshttps://doi.org/10.1145/2933575.2935315openalex-snapshot
Two-Way Visibly Pushdown Automata and Transducers
inferred← citeshttps://doi.org/10.1145/3209108.3209163openalex-snapshot
Regular and First-Order List Functions
inferred← citeshttps://doi.org/10.1145/3209108.3209181openalex-snapshot
Logics for Word Transductions with Synthesis
inferred← citeshttps://doi.org/10.1145/3373718.3394785openalex-snapshot
First-order tree-to-tree functions
inferred← citeshttps://doi.org/10.1145/371316.371512openalex-snapshot
MSO definable string transductions and two-way finite-state transducers
inferred← citeshttps://doi.org/10.4204/eptcs.151.5openalex-snapshot
Equivalence Problems for Tree Transducers: A Brief Survey
inferred← citeshttps://doi.org/10.4230/lipics.fsttcs.2010.1openalex-snapshot
Expressiveness of streaming string transducers
inferred← citeshttps://doi.org/10.4230/lipics.icalp.2019.128openalex-snapshot
Sequentiality of String-to-Context Transducers
inferred← citeshttps://doi.org/10.4230/lipics.icalp.2020.135openalex-snapshot
Comparison-Free Polyregular Functions
inferred← citeshttps://doi.org/10.4230/lipics.mfcs.2021.40openalex-snapshot
Pebble Transducers with Unary Output
inferred← citeshttps://doi.org/10.48550/arxiv.1902.06973openalex-snapshot
Equivalence of finite-valued streaming string transducers is decidable
inferred← citeshttps://doi.org/10.48550/arxiv.2102.08705openalex-snapshot
On polynomial grammars extended with substitution
inferred← citeshttps://doi.org/10.48550/arxiv.cs/0506014openalex-snapshot
The Equivalence Problem for Deterministic MSO Tree Transducers is Decidable
inferred← citeshttps://doi.org/10.70675/fe8b87ddzf384z4bdfz8673z595b863754c9openalex-snapshot
On decision problems on word transducers with origin semantics
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.