Regular combinators for string transformations

DOI10.1145/2603088.2603151zbMath1401.68141arXiv1402.3021OpenAlexW2079179697MaRDI QIDQ4635591

Mukund Raghothaman, Adam Freilich, Rajeev Alur

Publication date: 23 April 2018

Published in: Proceedings of the Joint Meeting of the Twenty-Third EACSL Annual Conference on Computer Science Logic (CSL) and the Twenty-Ninth Annual ACM/IEEE Symposium on Logic in Computer Science (LICS) (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1402.3021

Mathematics Subject Classification ID

Formal languages and automata (68Q45) Algebraic theory of languages and automata (68Q70)

Related Items (13)

Complexity of regular functions ⋮ Unnamed Item ⋮ Better complexity bounds for cost register automata ⋮ Unnamed Item ⋮ Unnamed Item ⋮ Decidable weighted expressions with Presburger combinators ⋮ Unnamed Item ⋮ Streamable regular transductions ⋮ Regular Programming for Quantitative Properties of Data Streams ⋮ Regular transducer expressions for regular transformations ⋮ Unnamed Item ⋮ From Two-Way Transducers to Regular Function Expressions ⋮ Better complexity bounds for cost register automata

This page was built for publication: Regular combinators for string transformations