تقرير
The algebra of binary trees is affine complete
| العنوان: | The algebra of binary trees is affine complete |
|---|---|
| المؤلفون: | Arnold, Andre, Cegielski, Patrick, Grigorieff, Serge, Guessarian, Irene |
| المصدر: | Discrete Mathematics & Theoretical Computer Science, vol. 23 no. 2, special issue in honour of Maurice Pouzet, Special issues (November 4, 2021) dmtcs:6890 |
| سنة النشر: | 2020 |
| المجموعة: | Computer Science |
| مصطلحات موضوعية: | Computer Science - Formal Languages and Automata Theory, 06A99, 08A30, 08B20 |
| الوصف: | A function on an algebra is congruence preserving if, for any congruence, it maps pairs of congruent elements onto pairs of congruent elements. We show that on the algebra of binary trees whose leaves are labeled by letters of an alphabet containing at least three letters, a function is congruence preserving if and only if it is polynomial. Comment: 9 pages, 1 figure |
| نوع الوثيقة: | Working Paper |
| DOI: | 10.46298/dmtcs.6890 |
| URL الوصول: | http://arxiv.org/abs/2011.03925 |
| رقم الأكسشن: | edsarx.2011.03925 |
| قاعدة البيانات: | arXiv |
| DOI: | 10.46298/dmtcs.6890 |
|---|