| Article ID | Journal | Published Year | Pages | File Type |
|---|---|---|---|---|
| 438828 | Theoretical Computer Science | 2006 | 17 Pages |
Abstract
We associate a modal operator with each language belonging to a given class of regular tree languages and use the cascade product of tree automata to give an algebraic characterization of the expressive power of the resulting logic.
Related Topics
Physical Sciences and Engineering
Computer Science
Computational Theory and Mathematics
