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...
Saved in:
| Date: | 2024 |
|---|---|
| Main Authors: | , , |
| Format: | Article |
| Language: | English |
| Published: |
Lugansk National Taras Shevchenko University
2024
|
| Subjects: | |
| Online Access: | https://admjournal.luguniv.edu.ua/index.php/adm/article/view/2013 |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| Journal Title: | Algebra and Discrete Mathematics |
Institution
Algebra and Discrete Mathematics| Summary: | 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. |
|---|