The many facets of string transducers (invited talk)
From MaRDI portal
Publication:5090448
DOI10.4230/LIPICS.STACS.2019.2MaRDI QIDQ5090448FDOQ5090448
Authors: Anca Muscholl, Gabriele Puppis 
Publication date: 18 July 2022
Recommendations
Cites Work
- The equivalence of finite valued transducers (on HDT0L languages) is decidable
- Graph structure and monadic second-order logic. A language-theoretic approach
- Title not available (Why is that?)
- Title not available (Why is that?)
- Reversal-Bounded Multicounter Machines and Their Decision Problems
- On Relations Defined by Generalized Finite Automata
- Weak Second‐Order Arithmetic and Finite Automata
- The complexity of decision problems for finite-turn multicounter machines
- Expressiveness of streaming string transducers
- Nondeterministic Streaming String Transducers
- A SURVEY ON SMALL FRAGMENTS OF FIRST-ORDER LOGIC OVER FINITE WORDS
- The Equivalence Problem for Deterministic Two-Way Sequential Transducers is Decidable
- A note on finite-valued and finitely ambiguous transducers
- The Unsolvability of the Equivalence Problem for $\varepsilon $-Free NGSM’s with Unary Input (Output) Alphabet and Applications
- Two-way two-tape automata
- A general theory of translation
- Une caractérisation des fonctions séquentielles et des fonctions sous- séquentielles en tant que rélations rationnelles
- A proof of Ehrenfeucht's conjecture
- Determinization of transducers over finite and infinite words.
- Minimizing subsequential transducers: a survey.
- Multitape one-way nonwriting automata
- The Equivalence Problem for Single-Valued Two-Way Transducers (on NPDTOL Languages) is Decidable
- The decidability of equivalence for deterministic finite transducers
- The Ehrenfeucht conjecture: A compactness claim for finitely generated free monoids
- Squaring transducers: An efficient procedure for deciding functionality and sequentiality.
- MSO definable string transductions and two-way finite-state transducers
- Single-valued a-transducers
- A Characterization of Machine Mappings
- Equivalence of infinite systems of equations in free groups and semigroups to finite subsystems
- Decision problems among the main subfamilies of rational relations
- Title not available (Why is that?)
- A survey on the local divisor technique
- Synchronizing relations on words
- On equivalence and uniformisation problems for finite transducers
- Visibly pushdown transducers
- Transducers with Origin Information
- Copyful streaming string transducers
- On reversible transducers
- Regular combinators for string transformations
- A generalised twinning property for minimisation of cost register automata
- Closure properties of synchronized relations
- Polynomial automata: zeroness and applications
- First-order definable string transformations
- Regular transformations of infinite strings
- Which classes of origin graphs are generated by transducers
- Aperiodic two-way transducers and FO-transductions
- From two-way to one-way finite state transducers
- One-way definability of sweeping transducer
- Two-way visibly pushdown automata and transducers
- On the decomposition of finite-valued streaming string transducers
- Untwisting two-way transducers in elementary time
- Minimizing resources of sweeping and streaming string transducers
- Title not available (Why is that?)
- Resynchronizing classes of word relations
- Title not available (Why is that?)
- Regular and First-Order List Functions
Cited In (3)
This page was built for publication: The many facets of string transducers (invited talk)
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5090448)
