Algebraic recognizability of regular tree languages
| dc.creator | Esik, Zoltan | |
| dc.creator | Weil, Pascal | |
| dc.date | 2006-09-20 | |
| dc.date.accessioned | 2026-07-07T07:23:55Z | |
| dc.date.available | 2026-07-07T07:23:55Z | |
| dc.description | We propose a new algebraic framework to discuss and classify recognizable tree languages, and to characterize interesting classes of such languages. Our algebraic tool, called preclones, encompasses the classical notion of syntactic Sigma-algebra or minimal tree automaton, but adds new expressivity to it. The main result in this paper is a variety theorem à la Eilenberg, but we also discuss important examples of logically defined classes of recognizable tree languages, whose characterization and decidability was established in recent papers (by Benedikt and Ségoufin, and by Bojanczyk and Walukiewicz) and can be naturally formulated in terms of pseudovarieties of preclones. Finally, this paper constitutes the foundation for another paper by the same authors, where first-order definable tree languages receive an algebraic characterization. | |
| dc.identifier | https://arxiv.org/abs/cs/0609113 | |
| dc.identifier | http://arxiv.org/abs/cs/0609113 | |
| dc.identifier | Theoretical Computer Science 340 (2005) 291-321 | |
| dc.identifier.uri | http://salesiana.dossiersoluciones.com/handle/123456789/116163 | |
| dc.subject | Discrete Mathematics | |
| dc.title | Algebraic recognizability of regular tree languages | |
| dc.type | text |