Introduction

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

The fundamental results of Büchi [Büc62] and Rabin [Rab69] state that the monadic second-order (mso) theory of the ω-chain (ω,≤) and of the complete binary tree ({0, 1}*,≼,≤lex) is decidable.

Original languageEnglish
Title of host publicationLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
PublisherSpringer Verlag
Chapter2
Pages29-36
Number of pages8
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 'Introduction'. Together they form a unique fingerprint.

Cite this