Document Open Access Logo

Transducing Linear Decompositions of Tournaments

Authors Colin Geniet , Fatemeh Ghasemi , Mamadou Moustapha Kanté

PDF

File

Thumbnail PDF
PDF
LIPIcs.ICALP.2026.179.pdf
  • Filesize: 0.75 MB
  • 15 pages

Document Identifiers

Related Versions

Subject Classification

ACM Subject Classification
  • Mathematics of computing → Graph theory
  • Theory of computation → Finite Model Theory
Keywords
  • Clique-width
  • definable decompositions
  • tournaments

Metrics

Abstract

Bojańczyk, Pilipczuk, and Grohe [LICS '18] proved that for graphs of bounded linear clique-width, clique-width decompositions of small width can be produced by a CMSO transduction. We show that in the case of tournaments, a first-order transduction suffices. This implies that the logics CMSO and existential MSO are equivalent over bounded linear clique-width tournaments.

Cite As Get BibTex

Colin Geniet, Fatemeh Ghasemi, and Mamadou Moustapha Kanté. Transducing Linear Decompositions of Tournaments. In 53rd International Colloquium on Automata, Languages, and Programming (ICALP 2026). Leibniz International Proceedings in Informatics (LIPIcs), Volume 374, pp. 179:1-179:15, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2026) https://doi.org/10.4230/LIPIcs.ICALP.2026.179

Author Details

Colin Geniet
  • Discrete Mathematics Group, Institute for Basic Science, Daejeon, South Korea
Fatemeh Ghasemi
  • Univ Paris Est Creteil, LACL, F-94010 Creteil, France
Mamadou Moustapha Kanté
  • Université Clermont Auvergne, Clermont Auvergne INP, LIMOS, CNRS, Clermont-Ferrand, France

Funding

  • Geniet, Colin: Supported by the Institute for Basic Science (IBS-R029-C1).
  • Ghasemi, Fatemeh: Supported by the ANR project DIFFERENCE (https://anr.fr/Projet-ANR-20-CE48-0002) and by IUT Sénart-Fontainebleau.

References

  1. Mikolaj Bojanczyk, Martin Grohe, and Michal Pilipczuk. Definable decompositions for graphs of bounded linear cliquewidth. Log. Methods Comput. Sci., 17(1), 2021. URL: https://lmcs.episciences.org/7125.
  2. Mikołaj Bojańczyk and Michał Pilipczuk. Definability equals recognizability for graphs of bounded treewidth. In Proceedings of the 31st Annual ACM/IEEE Symposium on Logic in Computer Science, LICS '16, pages 407-416, New York, NY, USA, 2016. Association for Computing Machinery. URL: https://doi.org/10.1145/2933575.2934508.
  3. Mikolaj Bojanczyk and Michal Pilipczuk. Optimizing tree decompositions in MSO. In Heribert Vollmer and Brigitte Vallée, editors, 34th Symposium on Theoretical Aspects of Computer Science, STACS 2017, March 8-11, 2017, Hannover, Germany, volume 66 of LIPIcs, pages 15:1-15:13. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2017. URL: https://doi.org/10.4230/LIPIcs.STACS.2017.15.
  4. J. Richard Büchi. Weak second-order arithmetic and finite automata. Mathematical Logic Quarterly, 6(1-6):66-92, 1960. URL: https://doi.org/10.1002/malq.19600060105.
  5. Thomas Colcombet. A combinatorial theorem for trees. In Lars Arge, Christian Cachin, Tomasz Jurdziński, and Andrzej Tarlecki, editors, Automata, Languages and Programming, pages 901-912, Berlin, Heidelberg, 2007. Springer Berlin Heidelberg. URL: https://doi.org/10.1007/978-3-540-73420-8_77.
  6. Bruno Courcelle and Joost Engelfriet. Graph Structure and Monadic Second-Order Logic - A Language-Theoretic Approach, volume 138 of Encyclopedia of mathematics and its applications. Cambridge University Press, 2012. URL: http://www.cambridge.org/fr/knowledge/isbn/item5758776/?site_locale=fr_FR.
  7. Bruno Courcelle and Stephan Olariu. Upper bounds to the clique width of graphs. Discret. Appl. Math., 101(1-3):77-114, 2000. URL: https://doi.org/10.1016/S0166-218X(99)00184-5.
  8. Calvin C. Elgot. Decision problems of finite automata design and related arithmetics. Transactions of the American Mathematical Society, 98(1):21-51, 1961. URL: http://www.jstor.org/stable/1993511.
  9. Manfred Kufleitner. The height of factorization forests. In Edward Ochmański and Jerzy Tyszkiewicz, editors, Mathematical Foundations of Computer Science 2008, pages 443-454, Berlin, Heidelberg, 2008. Springer Berlin Heidelberg. URL: https://doi.org/10.1007/978-3-540-85238-4_36.
  10. Imre Simon. Factorization forests of finite height. Theoretical Computer Science, 72(1):65-94, 1990. URL: https://doi.org/10.1016/0304-3975(90)90047-L.
  11. J. W. Thatcher and J. B. Wright. Generalized finite automata theory with an application to a decision problem of second-order logic. Math. Systems Theory, 2:57-81, 1968. URL: https://doi.org/10.1007/BF01691346.
Any Issues?
X

Feedback on the Current Page

CAPTCHA

Thanks for your feedback!

Feedback submitted to Dagstuhl Publishing

Could not send message

Please try again later or send an E-mail
© 2023-2026 Schloss Dagstuhl – LZI GmbH Schloss Dagstuhl – LZI GmbH About DROPS Imprint Privacy Contact