| Descriptional and computational complexity of finite automata—A survey M Holzer, M Kutrib Information and Computation 209 (3), 456-470, 2011 | 173 | 2011 |
| Nondeterministic descriptional complexity of regular languages M Holzer, M Kutrib International Journal of Foundations of Computer Science 14 (06), 1087-1102, 2003 | 156 | 2003 |
| State complexity of basic operations on nondeterministic finite automata M Holzer, M Kutrib International Conference on Implementation and Application of Automata, 148-157, 2002 | 84 | 2002 |
| Descriptional complexity—an introductory survey M Holzer, M Kutrib Scientific Applications of Language Methods, 1-58, 2011 | 77 | 2011 |
| Determination of finite automata accepting subregular languages H Bordihn, M Holzer, M Kutrib Theoretical Computer Science 410 (35), 3209-3222, 2009 | 68 | 2009 |
| Complexity of multi-head finite automata: Origins and directions M Holzer, M Kutrib, A Malcher Theoretical Computer Science 412 (1-2), 83-96, 2011 | 61 | 2011 |
| Nondeterministic finite automata—recent results on the descriptional and computational complexity M Holzer, M Kutrib International Journal of Foundations of Computer Science 20 (04), 563-580, 2009 | 58 | 2009 |
| Unary language operations and their nondeterministic state complexity M Holzer, M Kutrib International Conference on Developments in Language Theory, 162-172, 2002 | 58 | 2002 |
| On time computability of functions in one-way cellular automata T Buchholz, M Kutrib Acta Informatica 35 (4), 329-252, 1998 | 54 | 1998 |
| Reversible pushdown automata M Kutrib, A Malcher Journal of Computer and System Sciences 78 (6), 1814-1827, 2012 | 52 | 2012 |
| Cellular Automata and Language Theory. M Kutrib Encyclopedia of complexity and systems science, 800-823, 2009 | 48 | 2009 |
| On stateless two-pushdown automata and restarting automata M Kutrib, H Messerschmidt, F Otto International Journal of Foundations of Computer Science 21 (05), 781-798, 2010 | 45 | 2010 |
| The phenomenon of non-recursive trade-offs M Kutrib International Journal of Foundations of Computer Science 16 (05), 957-973, 2005 | 42 | 2005 |
| Cellular automata–a computational point of view M Kutrib New developments in formal languages and applications, 183-227, 2008 | 40 | 2008 |
| Some relations between massively parallel arrays T Buchholz, M Kutrib Parallel Computing 23 (11), 1643-1662, 1997 | 34 | 1997 |
| Multi-head finite automata: Characterizations, concepts and open problems M Holzer, M Kutrib, A Malcher arXiv preprint arXiv:0906.3051, 2009 | 33 | 2009 |
| Fast reversible language recognition using cellular automata M Kutrib, A Malcher Information and Computation 206 (9-10), 1142-1151, 2008 | 32 | 2008 |
| The size of Higman–Haines sets H Gruber, M Holzer, M Kutrib Theoretical Computer Science 387 (2), 167-176, 2007 | 32 | 2007 |
| More on the size of Higman-Haines sets: effective constructions H Gruber, M Holzer, M Kutrib Fundamenta Informaticae 91 (1), 105-121, 2009 | 31 | 2009 |
| Descriptional and computational complexity of finite automata M Holzer, M Kutrib International Conference on Language and Automata Theory and Applications, 23-42, 2009 | 30 | 2009 |
