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 |
| टैग: |
कोई टैग नहीं, इस रिकॉर्ड को टैग करने वाले पहले व्यक्ति बनें!
|