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 |
| Предметы: | |
| Online-ссылка: | https://lmcs.episciences.org/4447/pdf |
| Метки: |
Нет меток, Требуется 1-ая метка записи!
|