First-order definable string transformations
From MaRDI portal
Publication:2978509
DOI10.4230/LIPIcs.FSTTCS.2014.147zbMath1360.68555arXiv1406.7824OpenAlexW2258630338MaRDI QIDQ2978509
Emmanuel Filiot, Shankara Narayanan Krishna, Ashutosh Trivedi
Publication date: 25 April 2017
Full work available at URL: https://arxiv.org/abs/1406.7824
Formal languages and automata (68Q45) Automata and formal grammars in connection with logical questions (03D05)
Related Items (9)
A Circuit Complexity Approach to Transductions ⋮ Aperiodic String Transducers ⋮ One-way resynchronizability of word transducers ⋮ Unnamed Item ⋮ Aperiodic String Transducers ⋮ Regular transducer expressions for regular transformations ⋮ Copyful Streaming String Transducers ⋮ Unnamed Item ⋮ From Two-Way Transducers to Regular Function Expressions
This page was built for publication: First-order definable string transformations