1 Search Results for "Weiermann, Andreas"

Document
DOI: 10.4230/DagRep.6.1.69
Well Quasi-Orders in Computer Science (Dagstuhl Seminar 16031)

Authors: Jean Goubault-Larrecq, Monika Seisenberger, Victor Selivanov, and Andreas Weiermann

Published in: Dagstuhl Reports, Volume 6, Issue 1 (2016)

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.
Cite as

Jean Goubault-Larrecq, Monika Seisenberger, Victor Selivanov, and Andreas Weiermann. Well Quasi-Orders in Computer Science (Dagstuhl Seminar 16031). In Dagstuhl Reports, Volume 6, Issue 1, pp. 69-98, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2016)

Copy BibTex To Clipboard

@Article{goubaultlarrecq_et_al:DagRep.6.1.69,
  author =	{Goubault-Larrecq, Jean and Seisenberger, Monika and Selivanov, Victor and Weiermann, Andreas},
  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 =	{Goubault-Larrecq, Jean and Seisenberger, Monika and Selivanov, Victor and Weiermann, Andreas},
  publisher =	{Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
  address =	{Dagstuhl, Germany},
  URL =		{https://drops-dev.dagstuhl.de/entities/document/10.4230/DagRep.6.1.69},
  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,}
}
  • Refine by Author
  • 1 Goubault-Larrecq, Jean
  • 1 Seisenberger, Monika
  • 1 Selivanov, Victor
  • 1 Weiermann, Andreas

  • Refine by Classification

  • Refine by Keyword
  • 1 Better quasi-order
  • 1 Hierarchy
  • 1 Infinite State Machines
  • 1 Logic
  • 1 Noetherian space
  • Show More...

  • Refine by Type
  • 1 document

  • Refine by Publication Year
  • 1 2016

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
© 2023-2024 Schloss Dagstuhl – LZI GmbH Imprint Privacy Contact