Regular Transformations of Data Words Through Origin Information
From MaRDI portal
Publication:2811346
Recommendations
- A fundamental transformation on the rearrangements of words
- Burrows-Wheeler transformations and de Bruijn words
- Transformations on Words
- Burrows-Wheeler transform of words defined by morphisms
- On transformations of sets of words over a finite alphabet which do not propagate errors
- Regular expressions for data words
- Regular expressions for data words
- Word-oriented transformation shift registers and their linear complexity
Cites work
- scientific article; zbMATH DE number 1086492 (Why is no real title available?)
- scientific article; zbMATH DE number 3254906 (Why is no real title available?)
- Expressiveness of streaming string transducers
- From monadic second-order definable string transformations to transducers
- MSO definable string transductions and two-way finite-state transducers
- Monadic second-order definable graph transductions: a survey
- Regular transformations of infinite strings
- Streaming transducers for algorithmic verification of single-pass list-processing programs
- Transducers with Origin Information
Cited in
(6)- On computability of data word functions defined by transducers
- Synthesis of Data Word Transducers
- Origin-equivalence of two-way word transducers is in PSPACE
- A fundamental transformation on the rearrangements of words
- Which classes of origin graphs are generated by transducers
- Synthesis of data word transducers
This page was built for publication: Regular Transformations of Data Words Through Origin Information
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2811346)
