Publications

Open Access Books.

Monadic Second-Order Model Theory	[A5, A4]
Abstract Algebraic Language Theory	[A5, A4]
Logic, Algebra and Geometry	[A5, A4]

Unpublished.

• Achim Blumensath, Some Remarks on First-Order Definable Tree Languages.
• Achim Blumensath, The Expansion Problem for Infinite Trees.
• Achim Blumensath, Branch-Continuous Tree Algebras.

Published.

• Achim Blumensath, The Power-Set Construction for Tree Algebras. Logical Methods in Computer Science, 19(2023).
• Achim Blumensath, Jakub Lédl, Omega-Forest Algebras and Temporal Logics, Proc. 46th International Symposium on Mathematical Foundations of Computer Science MFCS, 2021, pp. 19:1-19:21.
• Achim Blumensath, Algebraic Language Theory for Eilenberg–Moore Algebras, Logical Methods in Computer Science, 17(2021).
• Achim Blumensath and Felix Wolf, Bisimulation Invariant Monadic Second-Order Logic in the Finite, Theoretical Computer Science, 823(2020), pp. 26-43.
• Achim Blumensath, Regular Tree Algebras, Logical Methods in Computer Science, 16(2020).
• Achim Blumensath and Felix Wolf, Bisimulation Invariant Monadic Second-Order Logic in the Finite, 45th International Colloquium on Automata, Languages, and Programming, ICALP, 2018, pp. 117:1-117:13.
• Achim Blumensath, Thomas Colcombet, and Pawel Parys On a Fragment of AMSO and Tiling Systems, Proc. 33rd Int. Symp. on Theoretical Aspects of Computer Science STACS, 2016.
• Achim Blumensath and David Janin A Syntactic Congruence for Languages of Birooted Trees, Semigroup Forum, 91(2015), pp. 675-698.
• Achim Blumensath, Martin Otto, and Mark Weyer, Decidability Results for the Boundedness Problem, Logical Methods in Computer Science, 10(2014).
• Achim Blumensath, Olivier Carton, and Thomas Colcombet, Asymptotic Monadic Second-Order Logic, Proc. 39th International Symposium on Mathematical Foundations of Computer Science MFCS (1), 2014, pp. 87-98.
• Achim Blumensath, Thomas Colcombet, Denis Kuperberg, Pawel Parys, and Michael Vanden Boom, Two-Way Cost Automata and Cost Logics over Infinite Trees, Proc. 23rd EACSL Conference on Computer Science Logic and 29th IEEE Symp. on Logic in Computer Science LICS, 2014.
• Achim Blumensath and Bruno Courcelle, Monadic second-order definable graph orderings, Logical Methods in Computer Science, 10(2014).
• Achim Blumensath and Viktor Winschel, A Coalgebraic Framework for Games in Economics, 19th International Conference on Computing in Economics and Finance, 2013.
• Achim Blumensath, An Algebraic Proof of Rabin's Tree Theorem, Theoretical Computer Science, 478(2013), pp. 1-21.
• Achim Blumensath, Erratum to “On the structure of graphs in the Caucal hierarchy”, Theoretical Computer Science, 475(2013), pp. 126-127.
• Achim Blumensath, Locality and modular Ehrenfeucht-Fraisse games, Journal of Applied Logic, 10(2012), pp. 144-162.
• Achim Blumensath, Recognisability for algebras of infinite trees, Theoretical Computer Science, 412(2011), pp. 3463-3486.
• Achim Blumensath, Simple Monadic Theories and Partition Width, Mathematical Logic Quarterly, 57(2011), pp. 409-431.
• 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. (Erratum)
• 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 and 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 theses.

• Matěj Záček, Automatic Structures of Polynomial Growth, Master's Thesis, 2023.
• Martin Blahynka, Non-well-founded Conway games, Bachelor's Thesis, 2020.
• Jakub Lédl, Algebras for Unranked Trees, Master's Thesis, 2019.
• Claire Ott, Linear Rank-Width and Interpretations, Bachelor's Thesis, 2016.
• Felix Wolf, Bisimulation Invariant MSO over Classes of Finite Transition Systems, Master's Thesis, 2015.
• Eduard Kamburjan, Tree-Interpretable Linear Orders, Student Paper, 2015.
• Elisabeth Jacobi, Weak Monadic Second-Order Logic on Infinitely Branching Trees, Diploma Thesis, 2013.
• Johanna Stumpf, Operationen zwischen geordneten Graphklassen, Bachelor's Thesis, 2013.
• Daniel Günzel, The Transduction Hierarchy for Infinite Structures, Bachelor's Thesis, 2010.