A Short Note on Infinite Union/Intersection of Omega Regular Languages
Formal Languages and Automata Theory
2016-03-18 v1 Logic in Computer Science
Abstract
We in this paper show that omega regular languages are not closed under infinite union and intersection. As an attempt, we propose to add step variables and quantifiers to temporal logics to enhance the expressiveness of the underlying logic. We also show that doing this would cause undecidability in satisfiability, even if for a rather limited fragment of temporal logic.
Keywords
Cite
@article{arxiv.1603.05426,
title = {A Short Note on Infinite Union/Intersection of Omega Regular Languages},
author = {Wanwei Liu},
journal= {arXiv preprint arXiv:1603.05426},
year = {2016}
}