Affordable Access

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

Authors
Publication Date
Source
Dagstuhl Research Online Publication Server
Keywords
  • Better Quasi-Order, Well Quasi-Order, Hierarchy, Infinite State Machines, Logic, Noetherian Space, R
  • Data Processing Computer Science
External links

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.

There are no comments yet on this publication. Be the first to share your thoughts.

Statistics

Seen <100 times
0 Comments