scientific article; zbMATH DE number 7561615
From MaRDI portal
Publication:5092324
DOI10.4230/LIPIcs.ICALP.2019.122MaRDI QIDQ5092324
Anca Muscholl, Gabriele Puppis
Publication date: 21 July 2022
Full work available at URL: https://arxiv.org/abs/1902.06973
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- The Ehrenfeucht conjecture: A compactness claim for finitely generated free monoids
- 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
- Lexicographic decomposition of \(k\)-valued transducers
- Multitape one-way nonwriting automata
- Expressiveness of Streaming String Transducers
- Nondeterministic Streaming String Transducers
- Decomposing a $k$-valued transducer into $k$ unambiguous ones
- Satisfiability of word equations with constants is in PSPACE
- 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
- MSO definable string transductions and two-way finite-state transducers
- Regular Functions and Cost Register Automata
- Streaming transducers for algorithmic verification of single-pass list-processing programs
This page was built for publication:
