Document Open Access Logo

Separating Without Any Ambiguity

Authors Thomas Place, Marc Zeitoun



PDF
Thumbnail PDF

File

LIPIcs.ICALP.2018.137.pdf
  • Filesize: 0.49 MB
  • 14 pages

Document Identifiers

Author Details

Thomas Place
  • LaBRI, University of Bordeaux and IUF, France
Marc Zeitoun
  • LaBRI, University of Bordeaux, France

Cite AsGet BibTex

Thomas Place and Marc Zeitoun. Separating Without Any Ambiguity. In 45th International Colloquium on Automata, Languages, and Programming (ICALP 2018). Leibniz International Proceedings in Informatics (LIPIcs), Volume 107, pp. 137:1-137:14, Schloss Dagstuhl - Leibniz-Zentrum für Informatik (2018)
https://doi.org/10.4230/LIPIcs.ICALP.2018.137

Abstract

We investigate a standard operator on classes of languages: unambiguous polynomial closure. We show that if C is a class of regular languages having some mild properties, the membership problem for its unambiguous polynomial closure UPol(C) reduces to the same problem for C. We give a new, self-contained and elementary proof of this result. We also show that unambiguous polynomial closure coincides with alternating left and right deterministic closure. Finally, if additionally C is finite, we show that the separation and covering problems are decidable for UPol(C).

Subject Classification

ACM Subject Classification
  • Theory of computation → Regular languages
Keywords
  • Regular languages
  • separation problem
  • decidable characterizations

Metrics

  • Access Statistics
  • Total Accesses (updated on a weekly basis)
    0
    PDF Downloads

References

  1. Jorge Almeida, Jana Bartonová, Ondrej Klíma, and Michal Kunc. On decidability of intermediate levels of concatenation hierarchies. In Proceedings of the 19th International Conference on Developments in Language Theory, DLT'15, volume 9168 of Lecture Notes in Computer Science, pages 58-70. Springer, 2015. Google Scholar
  2. Mustapha Arfi. Polynomial operations on rational languages. In Proceedings of the 4th Annual Symposium on Theoretical Aspects of Computer Science, STACS'87, volume 247 of Lecture Notes in Computer Science, pages 198-206. Springer, 1987. Google Scholar
  3. Mustapha Arfi. Opérations polynomiales et hiérarchies de concaténation. Theoretical Computer Science, 91(1):71-84, 1991. Google Scholar
  4. Mário Branco and Jean-Éric Pin. Equations defining the polynomial closure of a lattice of regular languages. In Proceedings of the 36th International Colloquium on Automata, Languages, and Programming, ICALP'09, volume 5556 of Lecture Notes in Computer Science, pages 115-126. Springer, 2009. Google Scholar
  5. Volker Diekert, Paul Gastin, and Manfred Kufleitner. A survey on small fragments of first-order logic over finite words. International Journal of Foundations of Computer Science, 19(3):513-548, 2008. Google Scholar
  6. Kousha Etessami, Moshe Y. Vardi, and Thomas Wilke. First-order logic with two variables and unary temporal logic. In Proceedings of the 12th Annual IEEE Symposium on Logic in Computer Science, LICS'97, pages 228-235. IEEE Computer Society, 1997. Google Scholar
  7. Kousha Etessami, Moshe Y. Vardi, and Thomas Wilke. First-order logic with two variables and unary temporal logic. Information and Computation, 179(2):279-295, 2002. Google Scholar
  8. James Alexander Green. On the structure of semigroups. Annals of Mathematics, 54(1):163-172, 1951. Google Scholar
  9. Jean-Éric Pin. Propriétés syntactiques du produit non ambigu. In Proceedings of the 7th International Colloquium on Automata, Languages and Programming, ICALP'80, volume 85 of Lecture Notes in Computer Science, pages 483-499. Springer, 1980. Google Scholar
  10. Jean-Éric Pin. An explicit formula for the intersection of two polynomials of regular languages. In Proceedings of the 17th International Conference on Developments in Language Theory, DLT'13, volume 7907 of Lecture Notes in Computer Science, pages 31-45. Springer, 2013. Google Scholar
  11. Jean-Éric Pin. Mathematical foundations of automata theory. In preparation, 2016. URL: http://www.irif.fr/~jep/MPRI/MPRI.html.
  12. Jean-Éric Pin. The dot-depth hierarchy, 45 years later, chapter 8, pages 177-202. World Scientific, 2017. Google Scholar
  13. Jean-Éric Pin, Howard Straubing, and Denis Thérien. Locally trivial categories and unambiguous concatenation. Journal of Pure and Applied Algebra, 52(3):297-311, 1988. Google Scholar
  14. Jean-Éric Pin and Pascal Weil. Polynomial closure and unambiguous product. In Proceedings of the 22nd International Colloquium on Automata, Languages and Programming, ICALP'95, volume 944 of Lecture Notes in Computer Science, pages 348-359. Springer, 1995. Google Scholar
  15. Jean-Éric Pin and Pascal Weil. Polynomial closure and unambiguous product. Theory of Computing Systems, 30(4):383-422, 1997. Google Scholar
  16. Thomas Place. Separating regular languages with two quantifiers alternations. In Proceedings of the 30th Annual ACM/IEEE Symposium on Logic in Computer Science, LICS'15, pages 202-213. IEEE Computer Society, 2015. Google Scholar
  17. Thomas Place. Separating regular languages with two quantifiers alternations. Unpublished, a preliminary version can be found at https://arxiv.org/abs/1707.03295, 2018.
  18. Thomas Place, Lorijn van Rooijen, and Marc Zeitoun. Separating regular languages by piecewise testable and unambiguous languages. In Proceedings of the 38th International Symposium on Mathematical Foundations of Computer Science, MFCS'13, volume 8087 of Lecture Notes in Computer Science, pages 729-740. Springer, 2013. Google Scholar
  19. Thomas Place and Marc Zeitoun. Going higher in the first-order quantifier alternation hierarchy on words. In Proceedings of the 41st International Colloquium on Automata, Languages, and Programming, ICALP'14, volume 8573 of Lecture Notes in Computer Science, pages 342-353. Springer, 2014. Google Scholar
  20. Thomas Place and Marc Zeitoun. The covering problem: A unified approach for investigating the expressive power of logics. In Proceedings of the 41st International Symposium on Mathematical Foundations of Computer Science, MFCS'16, volume 58 of Leibniz International Proceedings in Informatics (LIPIcs), pages 77:1-77:15. Schloss Dagstuhl-Leibniz-Zentrum fuer Informatik, 2016. Google Scholar
  21. Thomas Place and Marc Zeitoun. Separation for dot-depth two. In Proceedings of the 32th Annual ACM/IEEE Symposium on Logic in Computer Science, LICS'17, pages 202-213. IEEE Computer Society, 2017. Google Scholar
  22. Thomas Place and Marc Zeitoun. The covering problem. Unpublished, a preliminary version can be found at https://arxiv.org/abs/1707.03370, 2018.
  23. Thomas Place and Marc Zeitoun. Generic results for concatenation hierarchies. Theory of Computing Systems, 2018. Selected papers from CSR'17. Google Scholar
  24. John L. Rhodes. A homomorphism theorem for finite semigroups. Mathematical Systems Theory, 1:289-304, 1967. Google Scholar
  25. Marcel-Paul Schützenberger. Sur le produit de concaténation non ambigu. Semigroup Forum, 13:47-75, 1976. Google Scholar
  26. Imre Simon. Piecewise testable events. In Proceedings of the 2nd GI Conference on Automata Theory and Formal Languages, volume 33 of Lecture Notes in Computer Science, pages 214-222. Springer, 1975. Google Scholar
  27. Pascal Tesson and Denis Thérien. Diamonds are forever: The variety DA. In Semigroups, Algorithms, Automata and Languages, pages 475-500. World Scientific, 2002. Google Scholar
  28. Denis Thérien and Thomas Wilke. Over words, two variables are as powerful as one quantifier alternation. In Proceedings of the 30th Annual ACM Symposium on Theory of Computing, STOC'98, pages 234-240. ACM, 1998. Google Scholar
  29. Wolfgang Thomas. Classifying regular events in symbolic logic. Journal of Computer and System Sciences, 25(3):360-376, 1982. Google Scholar
Questions / Remarks / Feedback
X

Feedback for Dagstuhl Publishing


Thanks for your feedback!

Feedback submitted

Could not send message

Please try again later or send an E-mail