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...
Na minha lista:
| 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 |
| 標簽: |
沒有標簽, 成為第一個標記此記錄!
|