Expressiveness of streaming string transducers
From MaRDI portal
Publication:2908833
DOI10.4230/LIPICS.FSTTCS.2010.1zbMATH Open1245.68115OpenAlexW1529428897MaRDI QIDQ2908833FDOQ2908833
Authors: Pavol Černý, Rajeev Alur 
Publication date: 29 August 2012
Full work available at URL: http://subs.emis.de/LIPIcs/frontdoor_6b0a.html
Recommendations
Formal languages and automata (68Q45) Specification and verification (program logics, model checking, etc.) (68Q60)
Cited In (36)
- Register Transducers Are Marble Transducers
- Title not available (Why is that?)
- Minimizing resources of sweeping and streaming string transducers
- Aperiodic string transducers
- Normality and two-way automata
- On the containment and equivalence problems for two-way transducers
- One-way resynchronizability of word transducers
- Non-deterministic transducer models of retransmission protocols over noisy channels
- Streaming transducers for algorithmic verification of single-pass list-processing programs
- Streaming ranked-tree-to-string transducers
- Streaming ranked-tree-to-string transducers
- Aperiodic string transducers
- Weak cost register automata are still powerful
- Robustness analysis of string transducers
- Regular model checking with regular relations
- The many facets of string transducers (invited talk)
- From two-way transducers to regular function expressions
- On polynomial recursive sequences
- Optimizing term rewriting with creeper trace transducers
- Copyful streaming string transducers
- Streamable regular transductions
- Kleenex: compiling nondeterministic transducers to deterministic streaming transducers
- Transducers of polynomial growth
- FO-definable transformations of infinite strings
- Copyful streaming string transducers
- Nondeterministic Streaming String Transducers
- On Synthesis of Resynchronizers for Transducers
- Origin-equivalence of two-way word transducers is in PSPACE
- Title not available (Why is that?)
- Sequentiality of string-to-context transducers
- On the decomposition of finite-valued streaming string transducers
- On deterministic 1-limited \(5' \rightarrow 3'\) sensing Watson-Crick finite-state transducers
- Title not available (Why is that?)
- Title not available (Why is that?)
- Regular Transformations of Data Words Through Origin Information
- Complexity of regular functions
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)
