@InProceedings{ganzow_et_al:LIPIcs.STACS.2008.1353,
  author =	{Ganzow, Tobias and Rubin, Sasha},
  title =	{{Order-Invariant MSO is Stronger than Counting MSO in the Finite}},
  booktitle =	{25th International Symposium on Theoretical Aspects of Computer Science},
  pages =	{313--324},
  series =	{Leibniz International Proceedings in Informatics (LIPIcs)},
  ISBN =	{978-3-939897-06-4},
  ISSN =	{1868-8969},
  year =	{2008},
  volume =	{1},
  editor =	{Albers, Susanne and Weil, Pascal},
  publisher =	{Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
  address =	{Dagstuhl, Germany},
  URL =		{https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.STACS.2008.1353},
  URN =		{urn:nbn:de:0030-drops-13535},
  doi =		{10.4230/LIPIcs.STACS.2008.1353},
  annote =	{Keywords: MSO, Counting MSO, order-invariance, expressiveness, Ehrenfeucht-Fraiss\'{e} game}
}