Level Two of the Quantifier Alternation Hierarchy Over Infinite Words-Reference-Cited by-同舟云学术

Level Two of the Quantifier Alternation Hierarchy Over Infinite Words

Published:2017-08-04 Issue:3 Volume:62 Page:467-480
ISSN:1432-4350
Container-title:Theory of Computing Systems
language:en
Short-container-title:Theory Comput Syst

Author:

Kufleitner Manfred,Walter Tobias

Funder

Deutsche Forschungsgemeinschaft

Publisher

Springer Science and Business Media LLC

Subject

Computational Theory and Mathematics,Theoretical Computer Science

Link

http://link.springer.com/article/10.1007/s00224-017-9801-x/fulltext.html

Reference21 articles.

1. Brzozowski, J.A., Knast, R.: The dot-depth hierarchy of star-free languages is infinite. J. Comput. Syst. Sci. 16(1), 37–55 (1978)

2. Diekert, V., Gastin, P., Kufleitner, M.: A survey on small fragments of first-order logic over finite words. Int. J. Found Comput. Sci. 19(3), 513–548 (2008)

3. Diekert, V., Kufleitner, M.: Fragments of first-order logic over infinite words. Theory Comput. Syst. 48(3), 486–516 (2011)

4. Eilenberg, S.: Automata Languages, and Machines, volume B. Academic Press (1976)

5. Kallas, J., Kufleitner, M., Lauser, A.: First-order fragments with successor over infinite words. In: STACS 2011, Proceedings, Volume 9 of LIPIcs, pp 356–367. Dagstuhl Publishing (2011)

Cited by 2 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. Forbidden Patterns for FO² Alternation Over Finite and Infinite Words;International Journal of Foundations of Computer Science;2023-02

2. Deciding FO2 Alternation for Automata over Finite and Infinite Words;Developments in Language Theory;2021