Finite-valued streaming string transducers
From MaRDI portal
Cites work
- A construction on finite automata that has remained hidden
- A note on finite-valued and finitely ambiguous transducers
- A proof of Ehrenfeucht's conjecture
- A regular and complete notion of delay for streaming string transducers
- Aperiodic string transducers
- Automatic presentations of structures
- Copyful streaming string transducers
- Decomposing a k-valued transducer into k unambiguous ones
- Decomposing Finite-Valued Transducers and Deciding Their Equivalence
- Equivalence of finite-valued tree transducers is decidable
- Equivalence of infinite systems of equations in free groups and semigroups to finite subsystems
- Expressiveness of streaming string transducers
- Graph structure and monadic second-order logic. A language-theoretic approach
- scientific article; zbMATH DE number 3841819 (Why is no real title available?)
- scientific article; zbMATH DE number 3911744 (Why is no real title available?)
- scientific article; zbMATH DE number 3757703 (Why is no real title available?)
- scientific article; zbMATH DE number 7561615 (Why is no real title available?)
- scientific article; zbMATH DE number 3254906 (Why is no real title available?)
- MSO definable string transductions and two-way finite-state transducers
- Multitape one-way nonwriting automata
- Nondeterministic Streaming String Transducers
- On finite semigroups of matrices
- On reversible transducers
- On the Decidability of Bounded Valuedness for Transducers
- On the decidability of the valuedness problem for two-way finite transducers
- On the decomposition of \(k\)-valued rational relations
- On the degree of ambiguity of finite automata
- On the growth rates of polyregular functions
- Outils et résultats pour les transducteurs boustrophédons
- Regular transformations of infinite strings
- Streaming transducers for algorithmic verification of single-pass list-processing programs
- Streaming tree transducers
- String-to-string interpretations with polynomial-size output
- Systems of word equations, polynomials and linear algebra: a new approach
- The complexity of decision problems for finite-turn multicounter machines
- The equivalence of finite valued transducers (on HDT0L languages) is decidable
- The Unsolvability of the Equivalence Problem for \varepsilon -Free NGSM’s with Unary Input (Output) Alphabet and Applications
- Transducers of polynomial growth
- Un algorithme calculant le cardinal, fini ou infini, des demi-groupes de matrices
Cited in
(2)
This page was built for publication: Finite-valued streaming string transducers
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6970244)
