EF+EX forest algebras

From MaRDI portal
Publication:2947153

DOI10.1007/978-3-319-23021-4_12zbMATH Open1465.68156arXiv1408.0809OpenAlexW2295054116MaRDI QIDQ2947153FDOQ2947153


Authors: A. Krebs, Howard Straubing Edit this on Wikidata


Publication date: 22 September 2015

Published in: Algebraic Informatics (Search for Journal in Brave)

Abstract: We examine languages of unranked forests definable using the temporal operators EF and EX. We characterize the languages definable in this logic, and various fragments thereof, using the syntactic forest algebras introduced by Bojanczyk and Walukiewicz. Our algebraic characterizations yield efficient algorithms for deciding when a given language of forests is definable in this logic. The proofs are based on understanding the wreath product closures of a few small algebras, for which we introduce a general ideal theory for forest algebras. This combines ideas from the work of Bojanczyk and Walukiewicz for the analogous logics on binary trees and from early work of Stiffler on wreath product of finite semigroups.


Full work available at URL: https://arxiv.org/abs/1408.0809




Recommendations



Cites Work


Cited In (9)





This page was built for publication: EF+EX forest algebras

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2947153)