When a Büchi language is definable in WMSO

David Hutchison, Takeo Kanad, Josef Kittler, Jon M. Kleinberg, Friedemann Mattern, John C. Mitchell, Moni Naor, C. Pandu Rangan, Bernhard Steffen, Demetri Terzopoulos, Doug Tygar, Gerhard Weikum, Michał Skrzypczak

Research output: Chapter in Book/Report/Conference proceedingChapterpeer-review

Abstract

This work is subject to copyright. Publisher, whether the whole or part of the material is concerned, specifically the rights of translation, reprinting, reuse of illustrations, recitation, broadcasting, reproduction on microfilms or in any other physical way, and transmission or information storage and retrieval, electronic adaptation, computer software, or by similar or dissimilar methodology now known or hereafter developed.

Original languageEnglish
Title of host publicationDescriptive Set Theoretic Methods in Automata Theory
Subtitle of host publicationDecidability and Topological Complexity
PublisherSpringer Verlag
Chapter4
Pages45-69
Number of pages25
DOIs
StatePublished - 6 Aug 2016

Publication series

NameLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Volume9802 LNCS

All Science Journal Classification (ASJC) codes

  • Theoretical Computer Science
  • General Computer Science

Fingerprint

Dive into the research topics of 'When a Büchi language is definable in WMSO'. Together they form a unique fingerprint.

Cite this