Level Two of the Quantifier Alternation Hierarchy Over Infinite Words
Level Two of the Quantifier Alternation Hierarchy Over Infinite Words
复制标题
无限单词上的量词交替层次结构的第二级
DOI:
10.1007/s00224-017-9801-x
复制
发表时间:
2018
影响因子:
0.5
通讯作者:
T. Walter
中科院分区:
文献类型:
--
作者:
M. Kufleitner;T. Walter
The study of various decision problems for logic fragments has a long history in computer science. This paper is on the membership problem for a fragment of first-order logic over infinite words; the membership problem asks for a given language whether it is definable in some fixed fragment. The alphabetic topology was introduced as part of an effective characterization of the fragment Σ2over infinite words. Here, Σ2consists of the first-order formulas with two blocks of quantifiers, starting with an existential quantifier. Its Boolean closure is. Our first main result is an effective characterization of the Boolean closure of the alphabetic topology, that is, given anω-regular languageL, it is decidable whetherLis a Boolean combination of open sets in the alphabetic topology. This is then used for transferring Place and Zeitoun’s recent decidability result forfrom finite to infinite words.
登录
查看更多内容
DOI:
10.1007/978-3-662-49630-5_14
发表时间:
2015
期刊:
ArXiv
影响因子:
--
作者:
Théo Pierron;Thomas Place;M. Zeitoun
通讯作者:
M. Zeitoun
DOI:
--
发表时间:
1982
期刊:
Journal of computer and system sciences (Print)
影响因子:
--
作者:
W. Thomas
通讯作者:
W. Thomas
DOI:
--
发表时间:
1974
期刊:
Journal of Information Processing and Cybernetics
影响因子:
--
作者:
Ludwig Staiger;K. W. Wagner
通讯作者:
K. W. Wagner
DOI:
--
发表时间:
2013
期刊:
RAIRO - Theoretical Informatics and Applications
影响因子:
--
作者:
Manfred Kufleitner;Tobias Walter
通讯作者:
Tobias Walter
DOI:
10.1007/978-3-642-59136-5_10
发表时间:
1997
期刊:
2021 IEEE/CVF Conference on Computer Vision and Pattern Recognition (CVPR)
影响因子:
--
作者:
J. Pin
通讯作者:
J. Pin