@InProceedings{	  em93,
  author	= "Werner Ebinger and Anca Muscholl",
  address	= "Heidelberg",
  booktitle	= "Proc. 20th International Colloquium Automata, Languages
		  and Programming (ICALP'93), Lund",
  editor	= "A. Lingas and R. Karlsson and S. Carlsson",
  volume	= "700",
  pages		= "335--346",
  publisher	= "Springer-Verlag",
  series	= "Lecture Notes in Computer Science",
  title		= "Logical definability on infinite traces",
  year		= "1993",
  abstract	= "The main results of the present paper are the equivalence
		  of monadic second order logic and recognizability for real
		  trace languages, and that first order definable, star-free,
		  and aperiodic real trace languages form the same class of
		  languages. This generalizes results on infinite words
		  [Tho90a, for an overview] and on finite traces [Tho90b,
		  GRS91] to infinite traces. It closes the last gap in the
		  different characterizations of recognizable infinitary
		  trace languages.",
  doi		= "10.1007/3-540-56939-1_84"
}