scientific article; zbMATH DE number 7559111
From MaRDI portal
Publication:5090448
DOI10.4230/LIPIcs.STACS.2019.2MaRDI QIDQ5090448
Anca Muscholl, Gabriele Puppis
Publication date: 18 July 2022
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Related Items (3)
Weighted two-way transducers ⋮ Weighted two-way transducers ⋮ Simulation by Rounds of Letter-to-Letter Transducers
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- The decidability of equivalence for deterministic finite transducers
- The Ehrenfeucht conjecture: A compactness claim for finitely generated free monoids
- A survey on the local divisor technique
- Synchronizing relations on words
- A proof of Ehrenfeucht's conjecture
- Equivalence of infinite systems of equations in free groups and semigroups to finite subsystems
- The equivalence of finite valued transducers (on HDT0L languages) is decidable
- The complexity of decision problems for finite-turn multicounter machines
- Single-valued a-transducers
- Une caractérisation des fonctions séquentielles et des fonctions sous- séquentielles en tant que rélations rationnelles
- Visibly pushdown transducers
- Copyful streaming string transducers
- Determinization of transducers over finite and infinite words.
- Squaring transducers: An efficient procedure for deciding functionality and sequentiality.
- Minimizing subsequential transducers: a survey.
- Regular transducer expressions for regular transformations
- Two-way two-tape automata
- Multitape one-way nonwriting automata
- Expressiveness of Streaming String Transducers
- First-order definable string transformations
- Regular Transformations of Infinite Strings
- Nondeterministic Streaming String Transducers
- Weak Second‐Order Arithmetic and Finite Automata
- Decision problems among the main subfamilies of rational relations
- A SURVEY ON SMALL FRAGMENTS OF FIRST-ORDER LOGIC OVER FINITE WORDS
- The Equivalence Problem for Single-Valued Two-Way Transducers (on NPDTOL Languages) is Decidable
- The Equivalence Problem for Deterministic Two-Way Sequential Transducers is Decidable
- A note on finite-valued and finitely ambiguous transducers
- Reversal-Bounded Multicounter Machines and Their Decision Problems
- The Unsolvability of the Equivalence Problem for $\varepsilon $-Free NGSM’s with Unary Input (Output) Alphabet and Applications
- MSO definable string transductions and two-way finite-state transducers
- Minimizing resources of sweeping and streaming string transducers
- On equivalence and uniformisation problems for finite transducers
- Regular combinators for string transformations
- Two-Way Visibly Pushdown Automata and Transducers
- A Generalised Twinning Property for Minimisation of Cost Register Automata
- Resynchronizing Classes of Word Relations
- Closure properties of synchronized relations
- On Reversible Transducers
- Regular and First-Order List Functions
- Transducers with Origin Information
- From Two-Way to One-Way Finite State Transducers
- One-way Definability of Sweeping Transducer.
- On Relations Defined by Generalized Finite Automata
- A Characterization of Machine Mappings
- A general theory of translation
This page was built for publication:
