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...
Kaydedildi:
| Asıl Yazarlar: | , |
|---|---|
| Materyal Türü: | Artigo |
| Dil: | Inglês |
| Baskı/Yayın Bilgisi: |
Logical Methods in Computer Science e.V.
2019-11-01
|
| Seri Bilgileri: | Logical Methods in Computer Science |
| Konular: | |
| Online Erişim: | https://lmcs.episciences.org/4447/pdf |
| Etiketler: |
Etiket eklenmemiş, İlk siz ekleyin!
|