Modular descriptions of regular functions

DOI10.1007/978-3-030-21363-3_1MaRDI QIDQ2175401zbMATH OpenOpenAlexFDO

Authors Paul Gastin

Publication date 29 April 2020

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

Mathematics Subject Classification ID

Formal languages and automata (68Q45)

Abstract: We discuss various formalisms to describe string-to-string transformations. Many are based on automata and can be seen as operational descriptions, allowing direct implementations when the input scanner is deterministic. Alternatively, one may use more human friendly descriptions based on some simple basic transformations (e.g., copy, duplicate, erase, reverse) and various combinators such as function composition or extensions of regular operations.

Recommendations

• Regular combinators for string transformations
• Aperiodic string transducers
• Transducers with Origin Information

Cited in

(3)

• Regularity of abstract-register transformations
• DReX: a declarative language for efficiently evaluating regular string transformations
• Regular combinators for string transformations

This page was built for publication: Modular descriptions of regular functions

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2175401)