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...
محفوظ في:
| المؤلفون الرئيسيون: | , |
|---|---|
| التنسيق: | Artigo |
| اللغة: | Inglês |
| منشور في: |
Logical Methods in Computer Science e.V.
2019-11-01
|
| سلاسل: | Logical Methods in Computer Science |
| الموضوعات: | |
| الوصول للمادة أونلاين: | https://lmcs.episciences.org/4447/pdf |
| الوسوم: |
لا توجد وسوم, كن أول من يضع وسما على هذه التسجيلة!
|