| Automatic structures A Blumensath, E Gradel Proceedings Fifteenth Annual IEEE Symposium on Logic in Computer Science …, 2000 | 422 | 2000 |
| Finite presentations of infinite structures: Automata and interpretations A Blumensath, E Grädel Theory of Computing Systems 37 (6), 641-674, 2004 | 155 | 2004 |
| Prefix-recognisable graphs and monadic second-order logic A Blumensath RWTH, Department of Computer Science, 2001 | 56 | 2001 |
| Logical theories and compatible operations. A Blumensath, T Colcombet, C Löding Logic and automata 2, 73-106, 2008 | 45 | 2008 |
| On the monadic second-order transduction hierarchy B Courcelle, A Blumensath Logical Methods in Computer Science 6, 2010 | 28* | 2010 |
| On the structure of graphs in the Caucal hierarchy A Blumensath Theoretical Computer Science 400 (1-3), 19-45, 2008 | 26 | 2008 |
| The monadic theory of tree-like structures D Berwanger, A Blumensath Automata Logics, and Infinite Games: A Guide to Current Research, 285-301, 2002 | 25 | 2002 |
| Recognisability for algebras of infinite trees A Blumensath Theoretical computer science 412 (29), 3463-3486, 2011 | 21 | 2011 |
| Recognizability, hypergraph operations, and logical types A Blumensath, B Courcelle Information and Computation 204 (6), 853-919, 2006 | 20 | 2006 |
| Decidability results for the boundedness problem M Weyer, M Otto, A Blumensath Logical Methods in Computer Science 10, 2014 | 19 | 2014 |
| Two-way cost automata and cost logics over infinite trees A Blumensath, T Colcombet, D Kuperberg, P Parys, MV Boom Proceedings of the Joint Meeting of the Twenty-Third EACSL Annual Conference …, 2014 | 16 | 2014 |
| Boundedness of monadic second-order formulae over finite words A Blumensath, M Otto, M Weyer Automata, Languages and Programming: 36th Internatilonal Collogquium, ICALP …, 2009 | 15 | 2009 |
| A model-theoretic characterisation of clique width A Blumensath Annals of Pure and Applied Logic 142 (1-3), 321-350, 2006 | 15 | 2006 |
| An algebraic proof of Rabin’s Tree Theorem A Blumensath Theoretical Computer Science 478, 1-21, 2013 | 14 | 2013 |
| An extension of Muchnik's theorem A Bluemnsath, S Kreutzer Journal of Logic and Computation 15 (1), 59-74, 2005 | 12 | 2005 |
| Structures of bounded partition width A Blumensath Bibliothek der RWTH Aachen, 2003 | 12 | 2003 |
| Axiomatising tree-interpretable structures A Blumensath STACS, 596-607, 2002 | 12 | 2002 |
| Monadic second-order definable graph orderings A Blumensath, B Courcelle arXiv preprint arXiv:1310.8148, 2013 | 11 | 2013 |
| Regular tree algebras A Blumensath Logical Methods in Computer Science 16, 2020 | 9 | 2020 |
| Axiomatising tree-interpretable structures A Blumensath Theory of Computing Systems 37 (1), 3-27, 2004 | 9 | 2004 |
