Two-Way Unary Temporal Logic over Trees - Computer Science > Logic in Computer ScienceReportar como inadecuado




Two-Way Unary Temporal Logic over Trees - Computer Science > Logic in Computer Science - Descarga este documento en PDF. Documentación en PDF para descargar gratis. Disponible también para leer online.

Abstract: We consider a temporal logic EF+F^-1 for unranked, unordered finite trees.The logic has two operators: EF\phi, which says -in some proper descendant \phiholds-, and F^-1\phi, which says -in some proper ancestor \phi holds-. Wepresent an algorithm for deciding if a regular language of unranked finitetrees can be expressed in EF+F^-1. The algorithm uses a characterizationexpressed in terms of forest algebras.



Autor: Mikolaj Bojanczyk

Fuente: https://arxiv.org/







Documentos relacionados