 | 2012 |
| 19 |  | Achim Blumensath:
Locality and modular Ehrenfeucht-Fraïssé games.
J. Applied Logic 10(1): 144-162 (2012) |
| 2011 |
| 18 |  | Achim Blumensath:
Simple monadic theories and indiscernibles.
Math. Log. Q. 57(1): 65-86 (2011) |
| 17 |  | Achim Blumensath:
Simple monadic theories and partition width.
Math. Log. Q. 57(4): 409-431 (2011) |
| 16 |  | Achim Blumensath:
Recognisability for algebras of infinite trees.
Theor. Comput. Sci. 412(29): 3463-3486 (2011) |
| 2010 |
| 15 |  | Achim Blumensath:
Guarded Second-Order Logic, Spanning Trees, and Network Flows
Logical Methods in Computer Science 6(1): (2010) |
| 14 |  | Achim Blumensath,
Bruno Courcelle:
On the Monadic Second-Order Transduction Hierarchy
Logical Methods in Computer Science 6(2): (2010) |
| 2009 |
| 13 |  | Achim Blumensath,
Martin Otto,
Mark Weyer:
Boundedness of Monadic Second-Order Formulae over Finite Words.
ICALP (2) 2009: 67-78 |
| 2008 |
| 12 |  | Achim Blumensath,
Thomas Colcombet,
Christof Löding:
Logical theories and compatible operations.
Logic and Automata 2008: 73-106 |
| 11 |  | Achim Blumensath:
On the structure of graphs in the Caucal hierarchy.
Theor. Comput. Sci. 400(1-3): 19-45 (2008) |
| 2006 |
| 10 |  | Achim Blumensath:
A model-theoretic characterisation of clique width.
Ann. Pure Appl. Logic 142(1-3): 321-350 (2006) |
| 9 |  | Achim Blumensath,
Bruno Courcelle:
Recognizability, hypergraph operations, and logical types.
Inf. Comput. 204(6): 853-919 (2006) |
| 2004 |
| 8 |  | Achim Blumensath:
Axiomatising Tree-Interpretable Structures.
Theory Comput. Syst. 37(1): 3-27 (2004) |
| 7 |  | Achim Blumensath,
Erich Grädel:
Finite Presentations of Infinite Structures: Automata and Interpretations.
Theory Comput. Syst. 37(6): 641-674 (2004) |
| 2003 |
| 6 |  | Achim Blumensath:
Structures of bounded partition width.
RWTH Aachen University 2003: 1-199 |
| 2002 |
| 5 |  | Achim Blumensath:
Axiomatising Tree-Interpretable Structures.
STACS 2002: 596-607 |
| 2001 |
| 4 |  | Dietmar Berwanger,
Achim Blumensath:
The Monadic Theory of Tree-like Structures.
Automata, Logics, and Infinite Games 2001: 285-302 |
| 3 |  | Dietmar Berwanger,
Achim Blumensath:
Automata for Guarded Fixed Point Logics.
Automata, Logics, and Infinite Games 2001: 343-355 |
| 2000 |
| 2 |  | Achim Blumensath:
Bounded Arithmetic and Descriptive Complexity.
CSL 2000: 232-246 |
| 1 |  | Achim Blumensath,
Erich Grädel:
Automatic Structures.
LICS 2000: 51-62 |