Expressiveness of streaming string transducers
From MaRDI portal
Recommendations
Cited in
(48)- Copyful streaming string transducers
- Regular model checking with regular relations
- One-way resynchronizability of word transducers
- Streamable regular transductions
- Normality and two-way automata
- Non-deterministic transducer models of retransmission protocols over noisy channels
- Complexity of regular functions
- Regular Transformations of Data Words Through Origin Information
- Aperiodic string transducers
- Kleenex: compiling nondeterministic transducers to deterministic streaming transducers
- Nondeterministic Streaming String Transducers
- On the containment and equivalence problems for two-way transducers
- Minimizing resources of sweeping and streaming string transducers
- scientific article; zbMATH DE number 7003194 (Why is no real title available?)
- FO-definable transformations of infinite strings
- On the decomposition of finite-valued streaming string transducers
- Aperiodic string transducers
- Copyful streaming string transducers
- On deterministic 1-limited 5' 3' sensing Watson-Crick finite-state transducers
- Register Transducers Are Marble Transducers
- scientific article; zbMATH DE number 7559429 (Why is no real title available?)
- The many facets of string transducers (invited talk)
- Origin-equivalence of two-way word transducers is in PSPACE
- scientific article; zbMATH DE number 7561353 (Why is no real title available?)
- scientific article; zbMATH DE number 7561615 (Why is no real title available?)
- Sequentiality of string-to-context transducers
- On Synthesis of Resynchronizers for Transducers
- Robustness analysis of string transducers
- Streaming transducers for algorithmic verification of single-pass list-processing programs
- Weak cost register automata are still powerful
- From two-way transducers to regular function expressions
- Streaming ranked-tree-to-string transducers
- Streaming ranked-tree-to-string transducers
- On polynomial recursive sequences
- Optimizing term rewriting with creeper trace transducers
- Transducers of polynomial growth
- Implicit automata in -calculi. III: Affine planar string-to-string functions
- What you must remember when transforming datawords
- Implicit automata in typed -calculi I: aperiodicity in a non-commutative logic
- On polynomial recursive sequences
- Single-use automata and transducers for infinite alphabets
- Edit distance of finite state transducers
- Finite-valued streaming string transducers
- Finite-valued streaming string transducers
- Comparison-free polyregular functions
- A framework for extraction and transformation of documents
- Lexicographic transductions of finite words
- Reversible pebble transducers
This page was built for publication: Expressiveness of streaming string transducers
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2908833)
