Two-Way Unary Temporal Logic over Trees
Abstract
We consider a temporal logic EF+F-1 for unranked, unordered finite trees. The logic has two operators: EFφ, which says "in some proper descendant φ holds", and F-1φ, which says "in some proper ancestor φ holds". We present an algorithm for deciding if a regular language of unranked finite trees can be expressed in EF+F-1. The algorithm uses a characterization expressed in terms of forest algebras.
0
Turn this paper into a lesson
ArcXiv compiles a structured reading guide from this paper's metadata: plain-English importance, contributions, prerequisite concepts, which sections to read first, flashcards, and a quiz. Grounded in the abstract, never invented.