From Two-Way Transducers to Regular Function Expressions
From MaRDI portal
Publication:5859650
DOI10.1142/S0129054120410087zbMath1477.68143OpenAlexW3091795338MaRDI QIDQ5859650
Pierre-Alain Reynier, Nicolas Baudru
Publication date: 19 April 2021
Published in: International Journal of Foundations of Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1142/s0129054120410087
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Factorization forests of finite height
- Monadic second-order definable graph transductions: a survey
- From two-way transducers to regular function expressions
- Regular transducer expressions for regular transformations
- Expressiveness of Streaming String Transducers
- An Algebraic Characterization of Unary Two-Way Transducers
- Two-way representations and weighted automata
- First-order definable string transformations
- Regular Transformations of Infinite Strings
- On the definition of a family of automata
- MSO definable string transductions and two-way finite-state transducers
- Regular combinators for string transformations
- Transducers with Origin Information
- From Two-Way to One-Way Finite State Transducers
- Boolean Matrices and the Stability of Neural Nets
This page was built for publication: From Two-Way Transducers to Regular Function Expressions
