Annual Symposium on Theoretical Aspects of Computer Science

STACS 2001: STACS 2001 pp 467-477

A New Logical Characterization of Büchi Automata

  • Giacomo Lenzi
Conference paper

DOI: 10.1007/3-540-44693-1_41

Volume 2010 of the book series Lecture Notes in Computer Science (LNCS)
Cite this paper as:
Lenzi G. (2001) A New Logical Characterization of Büchi Automata. In: Ferreira A., Reichel H. (eds) STACS 2001. STACS 2001. Lecture Notes in Computer Science, vol 2010. Springer, Berlin, Heidelberg

Abstract

We consider the monadic second order logic with two suc- cessor functions and equality, interpreted on the binary tree. We show that a set of assignments is definable in the fragment ∑2 of this logic if and only if it is definable by a Büchi automaton. Moreover we show that every set of second order assignments definable in ∑2 with equality is definable in ∑2 without equality as well. The present paper is sketchy due to space constraints; for more details and proofs see [7].

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Copyright information

© Springer-Verlag Berlin Heidelberg 2001

Authors and Affiliations

  • Giacomo Lenzi
    • 1
  1. 1.LaBRIUniversité Bordeaux ITalence CedexFrance