Copyright © 2006 Elsevier B.V. All rights reserved.
Characterizing EF and EX tree logics
Available online 10 February 2006.
References and further reading may be available for this article. To view references and further reading you must purchase this article.
Abstract
The expressive power of temporal branching time logics that use the modalities and
is described. Forbidden pattern characterizations are given for tree languages definable in three logics: EX, EF and EX+EF. The characterizations give algorithms for the definability problem in the respective logics that are polynomial in the size of a deterministic tree automaton representing the language.







E-mail Article
Add to my Quick Links

Cited By in Scopus (4)

2 occurs as a factor in a minimum number of words of length
+




