HAL will be down for maintenance from Friday, June 10 at 4pm through Monday, June 13 at 9am. More information
Skip to Main content Skip to Navigation

Well Quasi-Orders in Computer Science (Dagstuhl Seminar 16031).

Abstract : This report documents the program and the outcomes of Dagstuhl Seminar 16031 “Well Quasi-Orders in Computer Science”, the first seminar devoted to the multiple and deep interactions between the theory of Well quasi-orders (known as the Wqo-Theory) and several fields of Computer Science (Verification and Termination of Infinite-State Systems, Automata and Formal Languages, Term Rewriting and Proof Theory, topological complexity of computational problems on continuous functions). Wqo-Theory is a highly developed part of Combinatorics with ever-growing number of applications in Mathematics and Computer Science, and Well quasi-orders are going to become an important unifying concept of Theoretical Computer Science. In this seminar, we brought together several communities from Computer Science and Mathematics in order to facilitate the knowledge transfer between Mathematicians and Computer Scientists as well as between established and younger researchers and thus to push forward the interaction between Wqo-Theory and Computer Science.
Document type :
Complete list of metadata

Contributor : Jean Goubault-Larrecq Connect in order to contact the contributor
Submitted on : Wednesday, May 5, 2021 - 9:26:51 PM
Last modification on : Monday, December 13, 2021 - 9:17:21 AM


  • HAL Id : hal-03218880, version 1


Jean Goubault-Larrecq, Monika Seisenberger, Victor Selivanov, Andreas Weiermann. Well Quasi-Orders in Computer Science (Dagstuhl Seminar 16031).. [Research Report] Schloss Dagstuhl - Leibniz Center for Informatics. 2016. ⟨hal-03218880⟩



Record views