Characterizing CTL-like logics on finite trees. (Q2490815)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 5024252
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Characterizing CTL-like logics on finite trees. |
scientific article; zbMATH DE number 5024252 |
Statements
Characterizing CTL-like logics on finite trees. (English)
0 references
18 May 2006
0 references
temporal logic
0 references
tree automata
0 references
cascade product
0 references
pseudovariety
0 references
0 references
0 references
0 references
0 references
0.8208431601524353
0 references
0.819725513458252
0 references
0.817638099193573
0 references
0.8170177340507507
0 references
0.8151238560676575
0 references
