eng
episciences.org
Fundamenta Informaticae
0169-2968
1875-8681
2022-10-21
Volume 186, Issues 1-4:...
10.46298/fi-2022-8962
8962
journal article
Affine completeness of some free binary algebras
André Arnold
Patrick Cégielski
Irène Guessarian
A function on an algebra is congruence preserving if, for any congruence, it
maps pairs of congruent elements onto pairs of congruent elements. An algebra
is said to be affine complete if every congruence preserving function is a
polynomial function. We show that the algebra of (possibly empty) binary trees
whose leaves are labeled by letters of an alphabet containing at least one
letter, and the free monoid on an alphabet containing at least two letters are
affine complete.
https://fi.episciences.org/8962/pdf
Mathematics - Rings and Algebras
Computer Science - Formal Languages and Automata Theory
06A99 - 08A30 - 08B20
F.4.m