Associative string functions.
From MaRDI portal
Abstract: We introduce the concept of associativity for string functions, where a string function is a unary operation on the set of strings over a given alphabet. We discuss this new property and describe certain classes of associative string functions. We also characterize the recently introduced preassociative functions as compositions of associative string functions with injective unary maps. Finally, we provide descriptions of the classes of associative and preassociative functions which depend only on the length of the input.
Recommendations
Cites work
Cited in
(8)- Relaxations of associativity and preassociativity for variadic functions
- A characterization of barycentrically preassociative functions
- Barycentrically associative and preassociative functions
- Associative and preassociative functions.
- Preassociative aggregation functions
- CANCELLATION LAW AND UNIQUE FACTORIZATION THEOREM FOR STRING OPERATIONS
- Strongly barycentrically associative and preassociative functions
- A characterization of \(n\)-associative, monotone, idempotent functions on an interval that have neutral elements
This page was built for publication: Associative string functions.
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5178361)