License: 
Creative Commons Attribution 3.0 Unported license (CC BY 3.0)
When quoting this document, please refer to the following
DOI: 10.4230/DagRep.6.1.69
URN: urn:nbn:de:0030-drops-58158
URL: http://dagstuhl.sunsite.rwth-aachen.de/volltexte/2016/5815/
Goubault-Larrecq, Jean ;
Seisenberger, Monika ;
Selivanov, Victor ;
Weiermann, Andreas
Weitere Beteiligte (Hrsg. etc.): Jean Goubault-Larrecq and Monika Seisenberger and Victor Selivanov and Andreas Weiermann
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.
BibTeX - Entry
@Article{goubaultlarrecq_et_al:DR:2016:5815,
author = {Jean Goubault-Larrecq and Monika Seisenberger and Victor Selivanov and Andreas Weiermann},
title = {{Well Quasi-Orders in Computer Science (Dagstuhl Seminar 16031)}},
pages = {69--98},
journal = {Dagstuhl Reports},
ISSN = {2192-5283},
year = {2016},
volume = {6},
number = {1},
editor = {Jean Goubault-Larrecq and Monika Seisenberger and Victor Selivanov and Andreas Weiermann},
publisher = {Schloss Dagstuhl--Leibniz-Zentrum fuer Informatik},
address = {Dagstuhl, Germany},
URL = {http://drops.dagstuhl.de/opus/volltexte/2016/5815},
URN = {urn:nbn:de:0030-drops-58158},
doi = {10.4230/DagRep.6.1.69},
annote = {Keywords: Better quasi-order, Well quasi-order, Hierarchy, Infinite State Machines, Logic, Noetherian space, Reducibility, Termination, Topological Complexity, }
}
|
Keywords: |
|
Better quasi-order, Well quasi-order, Hierarchy, Infinite State Machines, Logic, Noetherian space, Reducibility, Termination, Topological Complexity, |
|
Collection: |
|
Dagstuhl Reports, Volume 6, Issue 1 |
|
Issue Date: |
|
2016 |
|
Date of publication: |
|
13.07.2016 |
