Regular Transformations of Data Words Through Origin Information
From MaRDI portal
Publication:2811346
DOI10.1007/978-3-662-49630-5_17zbMATH Open1475.68151OpenAlexW2465734435MaRDI QIDQ2811346FDOQ2811346
Antoine Durand-Gasselin, Peter Habermehl
Publication date: 10 June 2016
Published in: Lecture Notes in Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-662-49630-5_17
Recommendations
- A fundamental transformation on the rearrangements of words
- Regular transducer expressions for regular transformations
- Regular transducer expressions for regular transformations
- 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
- Title not available (Why is that?)
- Monadic second-order definable graph transductions: a survey
- Streaming transducers for algorithmic verification of single-pass list-processing programs
- Expressiveness of streaming string transducers
- Title not available (Why is that?)
- Streaming Tree Transducers
- MSO definable string transductions and two-way finite-state transducers
- Transducers with Origin Information
- Regular Transformations of Infinite Strings
- From Monadic Second-Order Definable String Transformations to Transducers
Cited In (5)
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)
