On the public citation graph

A note on finite-valued and finitely ambiguous transducers

https://doi.org/10.1007/bf01744569
0 signed · 98 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)90012-6openalex-snapshot
The decidability of equivalence for deterministic finite transducers
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(88)90012-6openalex-snapshot
On the finite-valuedness problem for sequential machines
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.1980.46openalex-snapshot
The equivalence problem for deterministic two-way sequential transducers is decidable
inferredcites →https://doi.org/10.1109/sfcs.1981.29openalex-snapshot
On the equivalence and containment problems for unambiguous regular expressions, grammars, and 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.1137/0211013openalex-snapshot
A Polynomial Time Algorithm for Deciding the Equivalence Problem for 2-Tape Deterministic Finite State Acceptors
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.1006/jcss.1997.1517openalex-snapshot
Transforming a Single-Valued Transducer Into a Mealy Machine
inferred← citeshttps://doi.org/10.1007/10719839_39openalex-snapshot
Squaring Transducers: An Efficient Procedure for Deciding Functionality and Sequentiality of Transducers
inferred← citeshttps://doi.org/10.1007/11779148_15openalex-snapshot
On Weakly Ambiguous Finite Transducers
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-54345-7_68openalex-snapshot
Efficient constructions of test sets for regular and context-free languages
inferred← citeshttps://doi.org/10.1007/3-540-57785-8_175openalex-snapshot
Economy of description for single-valued transducers
inferred← citeshttps://doi.org/10.1007/3540185356_28openalex-snapshot
The equivalence of mappings on languages
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/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-02444-8_30openalex-snapshot
Robustness Analysis of String Transducers
inferred← citeshttps://doi.org/10.1007/978-3-319-08019-2_23openalex-snapshot
Lossiness of Communication Channels Modeled by 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-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-03793-1_4openalex-snapshot
XML Security Views Revisited
inferred← citeshttps://doi.org/10.1007/978-3-642-15155-2_32openalex-snapshot
Properties of Visibly Pushdown 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-22321-1_26openalex-snapshot
On Two-Way Transducers
inferred← citeshttps://doi.org/10.1007/978-3-642-25535-9_1openalex-snapshot
Computing Degree of Parallelism for BPMN Processes
inferred← citeshttps://doi.org/10.1007/978-3-642-38771-5_24openalex-snapshot
Some Decision Questions Concerning the Time Complexity of Language Acceptors
inferred← citeshttps://doi.org/10.1007/978-3-642-40313-2_15openalex-snapshot
Determinacy and Rewriting of Top-Down and MSO Tree Transformations
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/bf01068368openalex-snapshot
Deterministic realization of nondeterministic computations with a low measure of nondeterminism
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/bfb0016250openalex-snapshot
The equivalence of finite valued transducers (on HDTOL languages) 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/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.1016/0020-0190(88)90167-6openalex-snapshot
Prefix and equality languages of rational functions are co-context-free
inferred← citeshttps://doi.org/10.1016/0020-0190(89)90080-xopenalex-snapshot
Deciding the immutability of regular codes and languages under finite transductions
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(88)90012-6openalex-snapshot
On the finite-valuedness problem for sequential machines
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(93)90325-nopenalex-snapshot
Efficient constructions of test sets for regular and context-free languages
inferred← citeshttps://doi.org/10.1016/0304-3975(94)90287-9openalex-snapshot
Finite-valued distance automata
inferred← citeshttps://doi.org/10.1016/j.ic.2014.07.003openalex-snapshot
Static analysis of XML security views and query rewriting
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.2019.06.021openalex-snapshot
Transducing reversibly with finite state machines
inferred← citeshttps://doi.org/10.1016/j.tcs.2024.114780openalex-snapshot
On the difference set of two transductions
inferred← citeshttps://doi.org/10.1016/s0304-3975(01)00214-6openalex-snapshot
Squaring transducers: an efficient procedure for deciding functionality and sequentiality
inferred← citeshttps://doi.org/10.1051/ita/1996300503791openalex-snapshot
Decomposing a $k$-valued transducer into $k$ unambiguous ones
inferred← citeshttps://doi.org/10.1109/ics51289.2020.00033openalex-snapshot
On the Valuedness of Symbolic Finite Transducers
inferred← citeshttps://doi.org/10.1109/lics.2012.18openalex-snapshot
Regular Transformations of Infinite Strings
inferred← citeshttps://doi.org/10.1109/lics.2013.53openalex-snapshot
From Two-Way to One-Way Finite State Transducers
inferred← citeshttps://doi.org/10.1137/0214044openalex-snapshot
On the Equivalence and Containment Problems for Unambiguous Regular Expressions, Regular Grammars and Finite Automata
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.1137/0222014openalex-snapshot
Decomposing Finite-Valued Transducers and Deciding Their Equivalence
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/s0129054103002126openalex-snapshot
FINITELY SUBSEQUENTIAL TRANSDUCERS
inferred← citeshttps://doi.org/10.1142/s0129054112400059openalex-snapshot
FORMAL DESCRIPTIONS OF CODE PROPERTIES: DECIDABILITY, COMPLEXITY, IMPLEMENTATION
inferred← citeshttps://doi.org/10.1142/s0129054114400280openalex-snapshot
SOME DECISION QUESTIONS CONCERNING THE TIME COMPLEXITY OF LANGUAGE ACCEPTORS
inferred← citeshttps://doi.org/10.1142/s0129054120410038openalex-snapshot
A Pattern Logic for Automata with Outputs
inferred← citeshttps://doi.org/10.1145/2933575.2934520openalex-snapshot
First-order definability of rational transductions
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.13164/ma.2012.02openalex-snapshot
Rule-restricted Automaton-grammar transducers: Power and Linguistic Applications
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.18255/1818-1015-2020-3-260-303openalex-snapshot
Efficient Equivalence Checking Technique for Some Classes of Finite-State Machines
inferred← citeshttps://doi.org/10.2168/lmcs-11(3:14)2015openalex-snapshot
Quantitative Languages Defined by Functional Automata
inferred← citeshttps://doi.org/10.25596/jalc-2003-117openalex-snapshot
Efficient Algorithms for Testing the Twins Property
inferred← citeshttps://doi.org/10.3103/s014641162107018xopenalex-snapshot
Efficient Equivalence Checking Technique for Some Classes of Finite-State Machines
inferred← citeshttps://doi.org/10.3103/s0278641925700177openalex-snapshot
Unification Problem for Finite State Parameterized Transducers
inferred← citeshttps://doi.org/10.3233/com-150050openalex-snapshot
Lossiness of communication channels modeled by transducers
inferred← citeshttps://doi.org/10.3233/fi-2016-1436openalex-snapshot
Visibly Pushdown Automata and Transducers with Counters
inferred← citeshttps://doi.org/10.4230/lipics.fsttcs.2014.133openalex-snapshot
Finite-Valued Weighted Automata
inferred← citeshttps://doi.org/10.4230/lipics.fsttcs.2014.431openalex-snapshot
Lipschitz Robustness of Finite-state Transducers
inferred← citeshttps://doi.org/10.4467/20838476si.13.005.2090openalex-snapshot
New Grammar Systems and Their Application Perspectives
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.2007.12940openalex-snapshot
Multitape automata and finite state transducers with lexicographic weights
inferred← citeshttps://doi.org/10.5555/2591370.2591389openalex-snapshot
From Two-Way to One-Way Finite State Transducers
inferred← citeshttps://doi.org/10.70675/103d5ffaz8ac1z4734z8baez06115519a946openalex-snapshot
Définissabilité et synthèse de transductions
inferred← citeshttps://doi.org/10.70675/28c6ed2ez142bz46b3zaed1zdd6eced3d708openalex-snapshot
Simplifying transducers using sequentiality
inferred← citeshttps://doi.org/10.70675/590f5519z2113z4c59z91b5z40f67914388dopenalex-snapshot
Minimizing resources for regular word transductions
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.