Publications

Unpublished.

• Achim Blumensath, An Algebraic Proof of Rabin's Tree Theorem.
• Achim Blumensath, Martin Otto, and Mark Weyer, Decidability Results for the Boundedness Problem.

Published.

• Achim Blumensath, Recognisability for algebras of infinite trees, Theoretical Computer Science, to appear.
• Achim Blumensath, Simple Monadic Theories and Partition Width, Mathematical Logic Quarterly, to appear.
• Achim Blumensath, Locality and modular Ehrenfeucht-Fraisse games, Journal of Applied Logic, to appear.
• Achim Blumensath, Simple Monadic Theories and Indiscernibles, Mathematical Logic Quarterly, 57(2011), pp. 65-86.
• Achim Blumensath and Bruno Courcelle, On the Monadic Second-Order Transduction Hierarchy, Logical Methods in Computer Science, 6(2010).
• Achim Blumensath, Guarded Second-Order Logic, Spanning Trees, and Network Flows, Logical Methods in Computer Science, 6(2010).
• Achim Blumensath, Martin Otto, and Mark Weyer, Boundedness of monadic second-order formulae over finite words, Proc. 36th International Colloquium on Automata, Languages and Programming, LNCS 5556(2009), pp. 67-79, (C) Springer-Verlag,
• Achim Blumensath, Simple Monadic Theories, Habilitation Thesis, TU Darmstadt, 2008.
• Achim Blumensath, On the structure of graphs in the Caucal hierarchy, Theoretical Computer Science, 400(2008), pp. 19-45.
• Achim Blumensath, Thomas Colcombet, and Christof Löding, Logical theories and compatible operations, in Logic and automata: History and Perspectives, (J. Flum, E. Grädel, T. Wilke, eds.), Amsterdam University Press, 2007, pp. 72-106.
• Achim Blumensath and Bruno Courcelle, Recognizability, Hypergraph Operations, and Logical Types, Information and Computation, 204(2006), pp. 853-919.
• Achim Blumensath, A Model Theoretic Characterisation of Clique-Width, Annals of Pure and Applied Logic, 142(2006), pp. 321-350.
• Achim Blumensath and Stephan Kreutzer, An Extension to Muchnik's Theorem, Journal of Logic and Computation, 15(2005), pp. 59-74.
• Achim Blumensath and Erich Grädel, Finite Presentations of Infinite Structures: Automata and Interpretations, Theory of Computing Systems, 37(2004), pp. 641-674, (C) Springer-Verlag.
• Achim Blumensath, Axiomatising tree-interpretable structures, Theory of Computing Systems, 37(2004), pp. 3-27, (C) Springer-Verlag.
• Achim Blumensath, Structures of Bounded Partition Width, Ph.D. Thesis, RWTH Aachen, 2003.
• Dietmar Berwanger and Achim Blumensath, The Monadic Theory of Tree-like Structures, in Automata, Logic, and Infinite Games (E. Grädel, W. Thomas, T. Wilke, eds.), LNCS 2500(2002), pp. 285-301, (C) Springer-Verlag.
• Dietmar Berwanger and Achim Blumensath, Automata for Guarded Fixed Point Logics, in Automata, Logic, and Infinite Games (E. Grädel, W. Thomas, T. Wilke, eds.), LNCS 2500(2002), pp. 343-355, (C) Springer-Verlag.
• Achim Blumensath and Erich Grädel, Finite Presentations of Infinite Structures: Automata and Interpretations, Proc. 2nd Int. Workshop on Complexity in Automated Deduction, CiAD 2002.
• Achim Blumensath, Axiomatising tree-interpretable structures, Proc. 19th Int. Symp. on Theoretical Aspects of Computer Science, LNCS 2285(2002), pp. 596-607, (C) Springer-Verlag, (full version below).
• Achim Blumensath, Axiomatising tree-interpretable structures, Tech. Rep. AIB-2001-10, RWTH Aachen, 2001. (full version)
• Achim Blumensath, Prefix-Recognisable Graphs and Monadic Second-Order Logic, Tech. Rep. AIB-2001-06, RWTH Aachen, 2001.
• Achim Blumensath, Bounded Arithmetic and Descriptive Complexity, Proc. 14th Ann. Conference of the European Association for Computer Science Logic, LNCS 1862(2000), pp. 232-246, (C) Springer-Verlag.
• Achim Blumensath, Erich Grädel Automatic Structures, Proc. 15th IEEE Symp. on Logic in Computer Science, 2000, pp. 51-62.
• Achim Blumensath, Automatic Structures, Diploma Thesis, RWTH Aachen, 1999.

Supervised thesis.

• Daniel Günzel, The Transduction Hierarchy for Infinite Structures, Bachelor Thesis, 2010.