| Article ID | Journal | Published Year | Pages | File Type |
|---|---|---|---|---|
| 422946 | Electronic Notes in Theoretical Computer Science | 2006 | 4 Pages |
Abstract
We use the cascade product of tree automata to give an algebraic characterization of the expressive power of CTL-like temporal logis on finite trees.
Related Topics
Physical Sciences and Engineering
Computer Science
Computational Theory and Mathematics
