The many facets of string transducers (invited talk)
From MaRDI portal
Publication:5090448
Recommendations
Cites work
- scientific article; zbMATH DE number 3660804 (Why is no real title available?)
- scientific article; zbMATH DE number 3561239 (Why is no real title available?)
- scientific article; zbMATH DE number 7003194 (Why is no real title available?)
- scientific article; zbMATH DE number 6862041 (Why is no real title available?)
- scientific article; zbMATH DE number 7561335 (Why is no real title available?)
- A Characterization of Machine Mappings
- A SURVEY ON SMALL FRAGMENTS OF FIRST-ORDER LOGIC OVER FINITE WORDS
- A general theory of translation
- A generalised twinning property for minimisation of cost register automata
- A note on finite-valued and finitely ambiguous transducers
- A proof of Ehrenfeucht's conjecture
- A survey on the local divisor technique
- Aperiodic two-way transducers and FO-transductions
- Closure properties of synchronized relations
- Copyful streaming string transducers
- Decision problems among the main subfamilies of rational relations
- Determinization of transducers over finite and infinite words.
- Equivalence of infinite systems of equations in free groups and semigroups to finite subsystems
- Expressiveness of streaming string transducers
- First-order definable string transformations
- From two-way to one-way finite state transducers
- Graph structure and monadic second-order logic. A language-theoretic approach
- MSO definable string transductions and two-way finite-state transducers
- Minimizing resources of sweeping and streaming string transducers
- Minimizing subsequential transducers: a survey.
- Multitape one-way nonwriting automata
- Nondeterministic Streaming String Transducers
- On Relations Defined by Generalized Finite Automata
- On equivalence and uniformisation problems for finite transducers
- On reversible transducers
- On the decomposition of finite-valued streaming string transducers
- One-way definability of sweeping transducer
- Polynomial automata: zeroness and applications
- Regular and First-Order List Functions
- Regular combinators for string transformations
- Regular transformations of infinite strings
- Resynchronizing classes of word relations
- Reversal-Bounded Multicounter Machines and Their Decision Problems
- Single-valued a-transducers
- Squaring transducers: An efficient procedure for deciding functionality and sequentiality.
- Synchronizing relations on words
- The Ehrenfeucht conjecture: A compactness claim for finitely generated free monoids
- The Equivalence Problem for Deterministic Two-Way Sequential Transducers is Decidable
- The Equivalence Problem for Single-Valued Two-Way Transducers (on NPDTOL Languages) is Decidable
- The Unsolvability of the Equivalence Problem for $\varepsilon $-Free NGSM’s with Unary Input (Output) Alphabet and Applications
- The complexity of decision problems for finite-turn multicounter machines
- The decidability of equivalence for deterministic finite transducers
- The equivalence of finite valued transducers (on HDT0L languages) is decidable
- Transducers with Origin Information
- Two-way two-tape automata
- Two-way visibly pushdown automata and transducers
- Une caractérisation des fonctions séquentielles et des fonctions sous- séquentielles en tant que rélations rationnelles
- Untwisting two-way transducers in elementary time
- Visibly pushdown transducers
- Weak Second‐Order Arithmetic and Finite Automata
- Which classes of origin graphs are generated by transducers
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)
