Sequentiality of string-to-context transducers
From MaRDI portal
Recommendations
Cites work
- scientific article; zbMATH DE number 5141500 (Why is no real title available?)
- scientific article; zbMATH DE number 3566194 (Why is no real title available?)
- scientific article; zbMATH DE number 1737190 (Why is no real title available?)
- A general theory of translation
- A generalised twinning property for minimisation of cost register automata
- A pattern logic for automata with outputs
- Determinization of transducers over finite and infinite words.
- Economy of description for single-valued transducers
- Expressiveness of streaming string transducers
- From two-way transducers to regular function expressions
- MSO definable string transductions and two-way finite-state transducers
- Minimizing resources of sweeping and streaming string transducers
- Nondeterministic Streaming String Transducers
- On the determinization of weighted finite automata
- Quantitative languages defined by functional automata
- Regular and First-Order List Functions
- Regular combinators for string transformations
- Sequential?
- Some definitional suggestions for automata theory
- Squaring transducers: An efficient procedure for deciding functionality and sequentiality.
- Streaming transducers for algorithmic verification of single-pass list-processing programs
- The Equivalence Problem for Deterministic Two-Way Sequential Transducers is Decidable
- Une caractérisation des fonctions séquentielles et des fonctions sous- séquentielles en tant que rélations rationnelles
- Uniqueness Theorems for Periodic Functions
- When is a functional tree transduction deterministic?
Cited in
(4)
This page was built for publication: Sequentiality of string-to-context transducers
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5092330)
