LIPIcs.MFCS.2019.29.pdf
- Filesize: 0.72 MB
- 14 pages
Document
The Quantifier Alternation Hierarchy of Synchronous Relations
Authors
-
Part of:
Volume:
44th International Symposium on Mathematical Foundations of Computer Science (MFCS 2019)
Series: Leibniz International Proceedings in Informatics (LIPIcs)
Conference: Mathematical Foundations of Computer Science (MFCS) - License:
Creative Commons Attribution 3.0 Unported license
- Publication date: 2019-08-20
Cite AsGet BibTex
Diego Figueira, Varun Ramanathan, and Pascal Weil. The Quantifier Alternation Hierarchy of Synchronous Relations. In 44th International Symposium on Mathematical Foundations of Computer Science (MFCS 2019). Leibniz International Proceedings in Informatics (LIPIcs), Volume 138, pp. 29:1-29:14, Schloss Dagstuhl - Leibniz-Zentrum für Informatik (2019)
https://doi.org/10.4230/LIPIcs.MFCS.2019.29
https://doi.org/10.4230/LIPIcs.MFCS.2019.29
Abstract
The class of synchronous relations, also known as automatic or regular, is one of the most studied subclasses of rational relations. It enjoys many desirable closure properties and is known to be logically characterized: the synchronous relations are exactly those that are defined by a first-order formula on the structure of all finite words, with the prefix, equal-length and last-letter predicates. Here, we study the quantifier alternation hierarchy of this logic. We show that it collapses at level Sigma_3 and that all levels below admit decidable characterizations. Our results reveal the connections between this hierarchy and the well-known hierarchy of first-order defined languages of finite words.
Subject Classification
ACM Subject Classification
- Theory of computation → Logic
- Theory of computation → Transducers
Keywords
- synchronous relations
- automatic relations
- first-order logic
- characterization
- quantifier alternation
Metrics
- Access Statistics
-
Total Accesses (updated on a weekly basis)
0PDF Downloads