A non-regular language of infinite trees that is recognizable by a sort-wise finite algebra
$\omega$-clones are multi-sorted structures that naturally emerge as algebras for infinite trees, just as $\omega$-semigroups are convenient algebras for infinite words. In the algebraic theory of languages, one hopes that a language is regular if and only if it is recognized by an algebra that is f...
שמור ב:
| Principais autores: | , |
|---|---|
| פורמט: | Artigo |
| שפה: | Inglês |
| יצא לאור: |
Logical Methods in Computer Science e.V.
2019-11-01
|
| סדרה: | Logical Methods in Computer Science |
| נושאים: | |
| גישה מקוונת: | https://lmcs.episciences.org/4447/pdf |
| תגים: |
אין תגיות, היה/י הראשונ/ה לתייג את הרשומה!
|