Algebras of generalized tree languages with fixed variables
Tree languages which are sets of terms always play a prominent role in the first-order languages and theoretical computer science. In this paper, tree languages induced by terms with fixed variables are considered. Under the applications of an operation on tree languages, we construct the algebra of...
Збережено в:
| Дата: | 2024 |
|---|---|
| Автори: | , , |
| Формат: | Стаття |
| Мова: | English |
| Опубліковано: |
Lugansk National Taras Shevchenko University
2024
|
| Теми: | |
| Онлайн доступ: | https://admjournal.luguniv.edu.ua/index.php/adm/article/view/2013 |
| Теги: |
Додати тег
Немає тегів, Будьте першим, хто поставить тег для цього запису!
|
| Назва журналу: | Algebra and Discrete Mathematics |
Репозитарії
Algebra and Discrete Mathematics| Резюме: | Tree languages which are sets of terms always play a prominent role in the first-order languages and theoretical computer science. In this paper, tree languages induced by terms with fixed variables are considered. Under the applications of an operation on tree languages, we construct the algebra of such languages having many properties of abstract clones. A strong connection with theory of general functions is given through a representation theorem. Additionally, the semigroup of mappings of which their images are tree languages with fixed variables is given. |
|---|