On the public citation graph

On the valuedness of finite transducers

0 signed · 85 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/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/978-3-663-09367-1openalex-snapshot

Transductions and Context-Free Languages

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/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.1007/bfb0017179openalex-snapshot

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

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/0304-3975(76)90026-8openalex-snapshot

Sur les relations rationnelles entre monoides libres

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/0304-3975(90)90189-oopenalex-snapshot

New techniques for proving the decidability of equivalence problems

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.1051/ita/1991250100191openalex-snapshot

On finitely generated monoids of matrices with entries in $\mathbb {N}$

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

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.1999.1633openalex-snapshot

Reasoning about Strings in Databases

inferred← citeshttps://doi.org/10.1007/3-540-48057-9_12openalex-snapshot

Using Acceptors as Transducers

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-57785-8_175openalex-snapshot

Economy of description for single-valued transducers

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-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-24886-4_7openalex-snapshot

Characterizing the Valuedness of Two-Way Finite Transducers

inferred← citeshttps://doi.org/10.1007/978-3-030-81508-0_20openalex-snapshot

Second-Order Finite Automata: Expressive Power and Simple Proofs Using Automatic Structures

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-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-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-27812-2_3openalex-snapshot

Rational Relations as Rational Series

inferred← citeshttps://doi.org/10.1007/978-3-540-30550-7_10openalex-snapshot

On the Maximum Coefficients of Rational Formal Series in Commuting Variables

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-04027-6_27openalex-snapshot

Automatic Structures of Bounded Degree Revisited

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-24897-9_12openalex-snapshot

Where Automatic Structures Benefit from Weighted Automata

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-662-55751-8_33openalex-snapshot

Automatic Kolmogorov Complexity and Normality Revisited

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/bfb0023852openalex-snapshot

Decomposing a k-valued transducer into k unambiguous ones

inferred← citeshttps://doi.org/10.1007/s00224-005-1265-8openalex-snapshot

Local Limit Properties for Pattern Statistics and Rational Models

inferred← citeshttps://doi.org/10.1007/s00224-009-9206-6openalex-snapshot

Lexicographic Decomposition of k-Valued Transducers

inferred← citeshttps://doi.org/10.1007/s00224-021-10044-xopenalex-snapshot

Observation and Distinction: Representing Information in Infinite Games

inferred← citeshttps://doi.org/10.1007/s11006-006-0191-7openalex-snapshot

Finite-automaton transformations of strictly almost-periodic sequences

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(92)90375-popenalex-snapshot

Rational relations and rational series

inferred← citeshttps://doi.org/10.1016/0304-3975(94)90287-9openalex-snapshot

Finite-valued distance 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.jcss.2020.12.003openalex-snapshot

Automatic Kolmogorov complexity, normality, and finite-state dimension revisited

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.2024.114780openalex-snapshot

On the difference set of two transductions

inferred← citeshttps://doi.org/10.1016/s0304-3975(00)00297-8openalex-snapshot

Using acceptors as transducers

inferred← citeshttps://doi.org/10.1016/s0304-3975(02)00847-2openalex-snapshot

Almost periodic sequences

inferred← citeshttps://doi.org/10.1051/ita/1996300503791openalex-snapshot

Decomposing a $k$-valued transducer into $k$ unambiguous ones

inferred← citeshttps://doi.org/10.1090/s0002-9947-2013-05766-2openalex-snapshot

The isomorphism problem on classes of automatic structures with transitive relations

inferred← citeshttps://doi.org/10.1109/ics51289.2020.00033openalex-snapshot

On the Valuedness of Symbolic Finite Transducers

inferred← citeshttps://doi.org/10.1109/lics52264.2021.9470688openalex-snapshot

From Finite-Valued Nondeterministic Transducers to Deterministic Two-Tape Automata

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.1142/s0129054114400280openalex-snapshot

SOME DECISION QUESTIONS CONCERNING THE TIME COMPLEXITY OF LANGUAGE ACCEPTORS

inferred← citeshttps://doi.org/10.1142/s0129054115400092openalex-snapshot

On the Ambiguity and Finite-Valuedness Problems in Acceptors and Transducers

inferred← citeshttps://doi.org/10.1142/s0129054120410038openalex-snapshot

A Pattern Logic for Automata with Outputs

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.2178/jsl/1318338854openalex-snapshot

Automatic structures of bounded degree revisited

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/s1066369x1001007xopenalex-snapshot

Almost periodicity, finite automata mappings, and related effectiveness issues

inferred← citeshttps://doi.org/10.3233/com-150050openalex-snapshot

Lossiness of communication channels modeled by transducers

inferred← citeshttps://doi.org/10.4213/mzm3084openalex-snapshot

Конечно-автоматные преобразования строго почти периодических последовательностей

inferred← citeshttps://doi.org/10.4230/lipics.fsttcs.2014.133openalex-snapshot

Finite-Valued Weighted Automata

inferred← citeshttps://doi.org/10.48550/arxiv.1701.09060openalex-snapshot

Automatic Kolmogorov complexity, normality and finite state dimension revisited

inferred← citeshttps://doi.org/10.48550/arxiv.1910.06019openalex-snapshot

Equivalence kernels of sequential functions and sequential observation synthesis

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.