Below, only publications since 2004 are listed.

2009

• M. Droste, W. Kuich, H. Vogler (eds.): Handbook of Weighted Automata, EATCS Monographs in Theoretical Computer Science, Springer-Verlag, 2009, in preparation.

2008

• M. Droste, P. Gastin: On aperiodic and star-free formal power series in partially commuting variables, Theory of Computing Systems 42 (2008), 608-631.

• M. Droste, R. Göbel: Stabilizers of direct composition series, submitted.

• M. Droste, R. Göbel, S. Pokutta: Absolute graphs with prescribed endomorphism monoids, Semigroup Forum 76 (2008), 256-267.

• M. Droste, R. Gray, J.K. Truss Construction of some uncountable 2-arc-transitive bipartite graphs, Order, to appear.

• M. Droste, W. Kuich, G. Rahonis Multi valued MSO logics over words and trees, Fundamenta Informaticae 84 (2008), 305-327.

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

• M. Droste, F. Huang, G.-Q. Zhang: A monoidal category of bifinite Chu spaces, in: 1st Int. Conf. on Foundations of Informatics, Computing and Software (FICS), Electronic Notes in Theoretical Computer Science 212 (2008), 285-297.

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

• M. Droste, G. Rahonis: Weighted automata and weighted logics on infinite words, Izvestiya VUZ. Matematika (2008), accepted.

• M. Droste, J. Sakarovitch, H. Vogler: Weighted automata with discounting, Information Processing Letters 108 (2008), 23-28.

• M. Droste, T. Stüber, H. Vogler: Weighted finite automata over strong bimon oids, submitted.

• M. Droste, J.K. Truss: Uncountable cofinalities of automorphism groupsof linear and partial orders, Algebra Universalis, to appear.

• M. Droste, G. Zhang: Random event structures, International Journal of Software and Informatics 2 (2008), 91-102.

• D. Kirsten: A burnside approach to the termination of Mohri's algorithm for polynomially ambiguous min-plus-automata, RAIRO - Theoretical Informatics and Applications, special issue on "Journées Montoises d'Informatique Théorique 2006 (JM'06)", to appear in 2008.

• D. Kuske: Compatibility of Shelah and Stupp's and of Muchnik's iteration with fragments of monadic second order logic, STACS 2008, 467-478, IFIB Schloss Dagstuhl (2008).

• D. Kuske: Schützenberger's theorem on formal power series follows from Kleene's theorem, Theoretical Computer Science 401 (2008) 243-248.

• D.Kuske, B.Bollig: Distributed Muller automata and logics, Information and Computation 206 (2008) 1084-1094.

• D. Kuske, I.Fichtner, I.Meinecke: Traces, series-parallel posets, and pictures: a weighted study. in: Handbook of Weighted Automata. To appear, 2008

• D. Kuske, M.Lohrey: Euler paths and ends in automatic and recursive graphs, Automata and Formal Languages 2008, 245-256, Hungarian Academy of Sciences (2008).

• D. Kuske, M.Lohrey: Hamiltonicity of automatic graphs, IFIP TCS 2008, 445-459, Springer (2009).

• D.Kuske, M.Lohrey: First-order and counting theories of omega-automatic struct ures, Journal of Symbolic Logic 73 (2008), 129-150.

• D. Kuske, I.Meinecke: Construction of tree automata from regular expressions, Developments in language theory 2008, 491-503, Springer Lecture Notes in Computer Science vol. 5257 (2008).

• I. Mäurer: Weighted picture automata and weighted logics. Theory of Computing Systems, 2008, accepted.

• Ch. Mathissen: Weighted logics for nested words and algebraic formal power series (pdf), Proc. of the 35th International Colloquium on Automata, Languages and Programming (ICALP), Reykjavik. Part II.
  Lecture Notes in Computer Science, vol. 5126, © Springer, 2008, pp. 221-232.
  EATCS Award "Best student ICALP paper" (track B)

2007

• M. Droste, H. Vogler (eds.): Special issue of Journal of Automata, Languages and Combinatorics, Workshop on "Weighted Automata: Theory and Applications" (Leipzig, March 2006), vol. 12 no. 4, 2007.

• M.Droste, P. Gastin: Weighted automata and weighted logics, Theoret. Comp. Science (special issue of ICALP '05), 380 (2007), 69-86. Full version: pdf

• M. Droste, Ch. Holland: Normal Subgroups of B_uAut(Ω), Applied Categorical Structures 15 (2007), 153-162.

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

• M. Droste, U. Püschmann: On weighted Büchi automata with order-complete weights, Intern. J. of Algebra and Computation, 17 (2007), 235-260.

• M. Droste, G. Rahonis: Weighted automata and weighted logics with discounting, 12th Int. Conf. on Implementation and Application of Automata (CIAA), Lecture Notes in Comp. Science vol. 4783, Springer 2007, pp. 73-84.

• M. Droste, H. Vogler: Weighted logics for XML Full version: ps

• M. Droste, G. Zhang: Bifinite Chu spaces, in: 2nd Conf. on Algebra and Coalgebra in Computer Science (CALCO), Lecture Notes in Comp. Science vol. 4624, Springer, 2007, pp. 179-193.

• D. Kirsten: Desert Automata V. On the Complexity of the Relative Inclusion Star Height Problem, Manuscript, 2007, unpublished.

• D. Kuske: Weighted asynchronous cellular automata, Theoretical Computer Science, 374 (2007), 127-148

• B. Bollig, D. Kuske, and Ingmar Meinecke: Propositional Dynamic Logic for Message-Passing Systems, FSTTCS 2007, 303-315, Springer Lecture Notes in Computer Science vol. 4855 (2007).

• P. Gastin and D. Kuske: Uniform satisfiability in PSPACE for local temporal logics over Mazurkiewicz traces, Fundamenta Informaticae 80, 169-197, 2007.

• B. Genest, D. Kuske, A. Muscholl: On communicating automata with bounded channels, Fundamenta Informaticae 80, 147-167, 2007.

• Ch. Mathissen: Definable Transductions and Weighted Logics for Texts, Proc. of the 11th Int. Conf. on Developments in Language Theory (DLT), Turku. Lecture Notes in Computer Science, vol. 4588, Springer, 2007, pp. 324-336.

• I. Mäurer: Characterizations of Recognizable Picture Series, Theoretical Computer Science 374, pp. 214-228, 2007

• I. Meinecke, B. Bollig: Weighted Distributed Systems and Their Logics, In: "Symposium on Logical Foundations of Computer Science (LFCS 2007)", Lecture Notes in Computer Science, vol. 4514, Springer, 2007, pp. 54-68.

2006

• M. Droste, J. Kari, P. Steinby: Observations on the smoothness properties of real functions computed by weighted finite automata, Fundamenta Informaticae, 73 (2006), 99-106.

• M. Droste, D. Kuske: Skew and infinitary formal power series, Theoret. Comp. Science 366 (2006), 199-227

• M. Droste, G. Rahonis: Weighted automata and weighted logics on infinite words, 10th Int. Conf. on Developments in Language Theory (DLT), Lecture Notes in Computer Science vol. 4036, Springer, 2006, pp. 49-58.

• M. Droste, J. Truss: On representing words in the automorphism group of the random graph, Journal of Group Theory 9, (2006) 815-836.

• M. Droste, H. Vogler: Weighted tree automata and weighted logics, Theoret. Comp.Science 366 (2006), 228-247.

• D.Kirsten: Distance Desert Automata and Star Height Substitutions. Habilitationsschrift, Universität Leipzig, Fakultät für Mathematik und Informatik, 2006.

• D.Kuske: Theories of orders an the set of words. Theoretical Informatics and Applications 40 (2006), 53-74.

• D. Kuske: Weighted asynchronous cellular automata STACS 2006, 685-696, © Springer Lecture Notes in Computer Science vol. 3884 (2006).

• D. Kuske, E. Fohry: On graph products of automatic and biautomatic monoids. Semigroup forum 72 (2006), 337-352.

• D.Kuske, B.Genest, A.Muscholl: A Kleene theorem and model checking algorithms for existentially bounded communicating automata. Information and Computation 204 (2006), 920-956.

• D. Kuske, M. Lohrey: Monadic chain logic over iterations and applications to push-down systems. LICS 2006, 91-100, IEEE Computer Society (2006)

• D. Kuske, M. Lohrey: Logical aspects of Cayley graphs: the monoid case. International Journal of Algebra and Computation 16 (2006), 307-340.

• D. Kuske, M. Lohrey: First-order and counting theories of omega-automatic structures FoSSaCS 2006, 322-336, © Springer Lecture Notes in Computer Science vol. 3921 (2006).

• I. Mäurer: Weighted Picture Automata and Weighted Logics. STACS 2006, LNCS 3884, pp. 313-324, Springer Berlin, 2006.

• I. Meinecke: Weighted Logics for Traces. In: "Computer Science - Theory and Applications: First International Computer Science Symposium in Russia, CSR 2006, St. Petersburg", LNCS 3976, Springer, 2006, pp. 235-246.

2005

• M. Droste, H. Vogler (eds.): Special issue of Journal of Automata, Languages and Combinatorics, Workshop on "Weighted Automata - Theory and Applications" (Dresden, June 2004), vol. 10, no. 2 & 3, 2005.

• M.Droste: Universal homogeneous causal sets, Journal of Mathematical Physics 46 (2005), 122503 1-10. Full version

• M.Droste, P. Gastin: Weighted automata and weighted logics, Automata, Languages and Programming (32nd ICALP, Lissabon), Lecture Notes in Comp. Science, vol. 3580, Springer, 2005, pp. 513-525.

• M. Droste, R. Göbel: Uncountable cofinalities of permutation groups, J. London Math. Soc. (2) 71 (2005), 335-344.

• M. Droste, W.Ch. Holland: Generating automorphism groups of chains. Forum Mathematicum 17 (2005), 699-710.

• M. Droste, C. Pech, H. Vogler: A Kleene theorem for weighted tree automata, Theory of Computing Systems, 38 (2005), 1-38.

• D. Kuske, P. Gastin: Uniform satisfiability problem for local temporal logics over Mazurkiewicz traces. CONCUR 2005, 533-547, © Springer Lecture Notes in Computer Science vol. 3653 (2005).

• D.Kuske, B.Genest, A.Muscholl, D.Peled: Snapshot Verification. TACAS 2005, 510-525, © Springer Lecture Notes in Computer Science vol. 3440 (2005).

• D. Kuske, M. Lohrey: Decidable first-order theories of one-step rewriting in trace monoids, Theory of Computing Systems 38 (2005), 39-81.

• D.Kuske, M.Lohrey: Logical aspects of Cayley graphs: the group case. Annals of Pure and Applied Logic 131 (2005), 263-286.

• I. Mäurer: Recognizable and Rational Picture Series. Conference on Algebraic Informatics, Thessaloniki. 2005

• I. Mäurer, D. Kirsten: On the Determinization of Weighted Automata Journal of Automata, Languages and Combinatorics, Special issue "Selected papers of the workshop Weighted Automata: Theory and Applications (Dresden, June 1-5 2004)"; Vol. 10 (2005) Number 2.

• I. Meinecke: The Hadamard Product of Sequential-Parallel Series. Journal of Automata, Languages and Combinatorics, Special issue "Selected papers of the workshop Weighted Automata: Theory and Applications (Dresden, June 1-5 2004)"; Vol. 10 (2005) Number 2.

2004

• D.Kuske, B. Genest, A. Muscholl: A Kleene Theorem for a Class of Communicating Automata with Effective Algorithms (invited talk by A. Muscholl). DLT 2004. 30-48, © Springer Lecture Notes in Computer Science vol. 3340 (2004).

• D.Kuske, I.Meinecke: Branching automata with costs - a way of reflecting parallelism in costs. Theoretical Computer Science 328 (2004), 53-75.

• D.Kuske, P.Weigelt: The rôle of the complementarity relation in Watson-Crick automata and sticker systems. DLT 2004, 272-283, © Springer Lecture Notes in Computer Science vol. 3340 (2004).

• I.Meinecke: Weighted Branching Automata - Combining Concurrency and Weights. Dissertation, TU Dresden.