Header menu link for other important links
X
Introduction
Published in Springer Verlag
2016
Volume: 9802 LNCS
   
Pages: 29 - 36
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. © Springer-Verlag Berlin Heidelberg 2016.
About the journal
JournalData powered by TypesetLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
PublisherData powered by TypesetSpringer Verlag
ISSN03029743
Open AccessNo
Concepts (6)
  •  related image
    Artificial intelligence
  •  related image
    Computer science
  •  related image
    Computers
  •  related image
    COMPLETE BINARY TREE
  •  related image
    Second orders
  •  related image
    Binary trees