Manfred Droste - Publications#

Please see http://www.informatik.uni-leipzig.de/~droste/publications.html

Major publications

M. Droste, W. Kuich, and H. Vogler (eds.): Handbook of Automata Theory, EATCS Monographs in Theoretical Computer Science, Springer, 2009.

M. Droste and D. Kuske: Skew and infinitary formal power series, Theoret. Comp. Science 366 (2006), 199-227; special issue of AFL 2005.

M. Droste and P. Gastin: Weighted automata and weighted logics, Theoret. Comp. Science 380 (2007), 69-86; special issue of ICALP 2005.

M. Droste and D. Kuske: Almost any domain is universal, 23rd Conf. on Mathematical Foundations of Programming Semantics (MFPS), Electronic Notes in Theoretical Computer Science 173 (2007), 103-119.

M. Droste, C. Holland, and G. Ulbrich: On full groups of measure-preserving and ergodic transformations with uncountable cofinalities, Bull. London Math. Soc. 40 (2008), 463-472.

M. Droste and K. Quaas: A Kleene-Schützenberger theorem for weighted timed automata, 11th Int. Conf. on Foundations of Software Science and Computation Structures (FoSSaCS), LNCS vol. 4962, pp. 142-156, Springer, 2008; full version to appear in Theoret. Comp. Science.

M. Droste and R. Göbel: Countable random p-groups with prescribed Ulm invariants, Proc. Amer. Math. Soc., in press.

M. Droste and G.-Q. Zhang: Bifinite Chu spaces, Logical Methods in Computer Science 6 (2010), 1-20.

M. Droste and I. Meinecke: Describing average- and longtime-behavior by weighted MSO logics, 35th Int. Symp. on Mathematical Foundations of Computer Science (MFCS), LNCS vol. 6281, pp. 537-548, Springer, 2010.

M. Droste and H. Vogler: Weighted logics for weighted unranked tree automata, Theory of Computing Systems 48 (2011), 23-47.