| Article ID | Journal | Published Year | Pages | File Type |
|---|---|---|---|---|
| 437556 | Theoretical Computer Science | 2011 | 24 Pages |
Abstract
We develop an algebraic language theory for languages of infinite trees. We define a class of algebras called ω-hyperclones and we show that a language of infinite trees is regular if, and only if, it is recognised by a finitary path-continuous ω-hyperclone.
Related Topics
Physical Sciences and Engineering
Computer Science
Computational Theory and Mathematics
