Bounded Arithmetic and Descriptive Complexity. - Achim Blumensath (CSL, 2000)

Automatic Structures. - Achim Blumensath; Erich Grädel (LICS, 2000)

The Monadic Theory of Tree-like Structures. - Dietmar Berwanger; Achim Blumensath (Automata, Logics, and Infinite Games, 2001)

Automata for Guarded Fixed Point Logics. - Dietmar Berwanger; Achim Blumensath (Automata, Logics, and Infinite Games, 2001)

Structures of bounded partition width. - Achim Blumensath (2003)

Axiomatising Tree-Interpretable Structures. - Achim Blumensath (Theory Comput. Syst., 2004)

Finite Presentations of Infinite Structures: Automata and Interpretations. - Achim Blumensath; Erich Grädel (Theory Comput. Syst., 2004)

An Extension of Muchnik's Theorem. - Achim Blumensath; Stephan Kreutzer (J. Log. Comput., 2005)

A model-theoretic characterisation of clique width. - Achim Blumensath (Ann. Pure Appl. Log., 2006)

Recognizability, hypergraph operations, and logical types. - Achim Blumensath; Bruno Courcelle (Inf. Comput., 2006)

Logical theories and compatible operations. - Achim Blumensath; Thomas Colcombet; Christof Löding (Logic and Automata, 2008)

On the structure of graphs in the Caucal hierarchy. - Achim Blumensath (Theor. Comput. Sci., 2008)

Boundedness of Monadic Second-Order Formulae over Finite Words. - Achim Blumensath; Martin Otto 001; Mark Weyer (ICALP (2), 2009)

Guarded Second-Order Logic, Spanning Trees, and Network Flows - Achim Blumensath (Log. Methods Comput. Sci., 2010)

On the Monadic Second-Order Transduction Hierarchy - Achim Blumensath; Bruno Courcelle (Log. Methods Comput. Sci., 2010)

Simple monadic theories and indiscernibles. - Achim Blumensath (Math. Log. Q., 2011)

Simple monadic theories and partition width. - Achim Blumensath (Math. Log. Q., 2011)

Recognisability for algebras of infinite trees. - Achim Blumensath (Theor. Comput. Sci., 2011)

Locality and modular Ehrenfeucht-Fraïssé games. - Achim Blumensath (J. Appl. Log., 2012)

Erratum to "On the structure of graphs in the Caucal hierarchy" [Theoret. Comput. Sci 400 (2008) 19-45]. - Achim Blumensath (Theor. Comput. Sci., 2013)

An algebraic proof of Rabin's Tree Theorem. - Achim Blumensath (Theor. Comput. Sci., 2013)

Two-way cost automata and cost logics over infinite trees. - Achim Blumensath; Thomas Colcombet; Denis Kuperberg; Pawel Parys; Michael Vanden Boom (CSL-LICS, 2014)

Asymptotic Monadic Second-Order Logic. - Achim Blumensath; Olivier Carton; Thomas Colcombet (MFCS (1), 2014)

Monadic second-order definable graph orderings. - Achim Blumensath; Bruno Courcelle (Log. Methods Comput. Sci., 2014)

Decidability Results for the Boundedness Problem. - Achim Blumensath; Martin Otto 001; Mark Weyer (Log. Methods Comput. Sci., 2014)

On a Fragment of AMSO and Tiling Systems. - Achim Blumensath; Thomas Colcombet; Pawel Parys (STACS, 2016)

A Compositional Coalgebraic Semantics of Strategic Games. - Achim Blumensath; Viktor Winschel (CoRR, 2017)

Branch-Continuous Tree Algebras. - Achim Blumensath (CoRR, 2018)

Regular Tree Algebras. - Achim Blumensath (Log. Methods Comput. Sci., 2020)

Bisimulation invariant monadic-second order logic in the finite. - Achim Blumensath; Felix Wolf 002 (Theor. Comput. Sci., 2020)

ω-Forest Algebras and Temporal Logics. - Achim Blumensath; Jakub Lédl (MFCS, 2021)

Algebraic Language Theory for Eilenberg-Moore Algebras. - Achim Blumensath (Log. Methods Comput. Sci., 2021)

The Expansion Problem for Infinite Trees. - Achim Blumensath (CoRR, 2023)

The Power-Set Construction for Tree Algebras. - Achim Blumensath (Log. Methods Comput. Sci., 2023)

Some Remarks on First-Order Definable Tree Languages. - Achim Blumensath (CoRR, 2024)

Automata for Enriched Trees and Applications. - Achim Blumensath (CoRR, 2025)

Simple Classes of Automatic Structures. - Achim Blumensath (CoRR, 2025)