| Conţinutul numărului revistei |
| Articolul precedent |
| Articolul urmator |
 |
 445 2 |
| Ultima descărcare din IBN: 2020-04-20 11:21 |
| Căutarea după subiecte similare conform CZU |
| 004.8+510.22+514.753.2+517.98 (1) |
| Artificial intelligence (307) |
| General problems of mathematical logic. Foundations of mathematics (5) |
| Differential geometry. Algebraic and analytic methods in geometry (26) |
| Differential equations. Integral equations. Other functional equations. Finite differences. Calculus of variations. Functional analysis (243) |
 SM ISO690:2012MEDUNA, Alexander, KRCMAR, Radim, KOVARI, Adam, BENICKOVA, Zuzana. On Operations over Language Families. In: Computer Science Journal of Moldova, 2019, nr. 3(81), pp. 255-282. ISSN 1561-4042. |
| EXPORT metadate: Google Scholar Crossref CERIF DataCite Dublin Core |
  Computer Science Journal of Moldova |
||||||
| Numărul 3(81) / 2019 / ISSN 1561-4042 /ISSNe 2587-4330 | ||||||
|
||||||
| CZU: 004.8+510.22+514.753.2+517.98 | ||||||
| MSC 2010: 68Q45, 03D05. | ||||||
| Pag. 255-282 | ||||||
|
||||||
 Descarcă PDF |
||||||
| Rezumat | ||||||
Let O and F be an operation and a language family, respectively. So far, in terms of closure properties, the classical language theory has only investigated whether O(F) ⊆ F, where O(F) is the family resulting from O applied to all members of F. If O(F) ⊆ F, F is closed under O; otherwise, it is not. This paper proposes a finer and wider approach to this investigation. Indeed, it studies almost all possible set-based relations between F and O(F), including O(F) = ∅; F 6⊂ O(F), O(F) 6⊂ F, F∩O(F) 6= ∅; F∩O(F) = ∅, O(F) 6= ∅; O(F) = F; and F ⊂ O(F). Many operations are studied in this way. A sketch of application perspectives and open problems closes the paper. |
||||||
| Cuvinte-cheie language operations language families closure properties finer approach new trend set theory |
||||||
|
|
|
|
