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...
Sábháilte in:
| Príomhchruthaitheoirí: | , |
|---|---|
| Formáid: | Artigo |
| Teanga: | Inglês |
| Foilsithe / Cruthaithe: |
Logical Methods in Computer Science e.V.
2019-11-01
|
| Sraith: | Logical Methods in Computer Science |
| Ábhair: | |
| Rochtain ar líne: | https://lmcs.episciences.org/4447/pdf |
| Clibeanna: |
Níl clibeanna ann, Bí ar an gcéad duine le clib a chur leis an taifead seo!
|