Recognisability for algebras of infinite trees |
| |
| Authors: | Achim Blumensath |
| |
| Affiliation: | TU Darmstadt, Schloßgartenstraße 7, 64289 Darmstadt, Germany |
| |
| 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. |
| |
| Keywords: | Infinite trees Recognisability Tree automata Monadic second-order logic |
| 本文献已被 ScienceDirect 等数据库收录！ |
|
