A Short Note on Infinite Union/Intersection of Omega Regular Languages

Autor:	Liu, Wanwei
Rok vydání:	2016
Předmět:	Computer Science - Formal Languages and Automata Theory Computer Science - Logic in Computer Science
Druh dokumentu:	Working Paper
Popis:	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.
Databáze:	arXiv
Externí odkaz:	http://arxiv.org/abs/1603.05426 Zobrazit plný text záznamu View this record from Arxiv