| Detecting social positions using simulation J Brynielsson, J Högberg, L Kaati, C Mårtenson, P Svenson 2010 International Conference on Advances in Social Networks Analysis and …, 2010 | 55 | 2010 |
| Learning a regular tree language from a teacher F Drewes, J Högberg International Conference on Developments in Language Theory, 279-291, 2003 | 48 | 2003 |
| Backward and forward bisimulation minimization of tree automata J Högberg, A Maletti, J May Theoretical Computer Science 410 (37), 3539-3552, 2009 | 34 | 2009 |
| Backward and forward bisimulation minimisation of tree automata J Högberg, A Maletti, J May International Conference on Implementation and Application of Automata, 109-121, 2007 | 33 | 2007 |
| Query learning of regular tree languages: How to avoid dead states F Drewes, J Högberg Theory of Computing Systems 40 (2), 163-185, 2007 | 27 | 2007 |
| Recognizing shuffled languages M Berglund, H Björklund, J Högberg International Conference on Language and Automata Theory and Applications …, 2011 | 25 | 2011 |
| Bisimulation minimization of tree automata PA Abdulla, L Kaati, J Högberg International Conference on Implementation and Application of Automata, 173-185, 2006 | 19 | 2006 |
| Bisimulation minimisation for weighted tree automata J Högberg, A Maletti, J May International Conference on Developments in Language Theory, 229-241, 2007 | 17 | 2007 |
| Bisimulation minimisation of weighted automata on unranked trees J Högberg, A Maletti, H Vogler Fundamenta Informaticae 92 (1-2), 103-130, 2009 | 14 | 2009 |
| MAT learners for tree series: an abstract data type and two realizations F Drewes, J Högberg, A Maletti Acta Informatica 48 (3), 165, 2011 | 12 | 2011 |
| Bisimulation minimization of tree automata PA Abdulla, J Högberg, L Kaati International Journal of Foundations of Computer Science 18 (04), 699-713, 2007 | 11 | 2007 |
| Weighted unranked tree automata as a framework for plan recognition J Högberg, L Kaati 2010 13th International Conference on Information Fusion, 1-8, 2010 | 9 | 2010 |
| Polynomial inference of universal automata from membership and equivalence queries J Björklund, H Fernau, A Kasprzik Information and Computation 246, 3-19, 2016 | 8 | 2016 |
| Compression of finite-state automata through failure transition H Björklund, J Björklund, N Zechner Theoretical Computer Science 557, 87-100, 2014 | 8 | 2014 |
| An algebra for tree-based music generation F Drewes, J Högberg International Conference on Algebraic Informatics, 172-188, 2007 | 8 | 2007 |
| Wind in the willows–generating music by means of tree transducers J Högberg International Conference on Implementation and Application of Automata, 153-162, 2005 | 8 | 2005 |
| Random context tree grammars and tree transducers: reviewed article F Drewes, C Du Toit, S Ewert, J Hogberg, B Van der Merwe, ... South African Computer Journal 2005 (34), 11-25, 2005 | 8 | 2005 |
| Mico-media in context P Aichroth, C Weigel, T Kurz, H Stadler, F Drewes, J Björklund, K Schlegel, ... 2015 IEEE International Conference on Multimedia & Expo Workshops (ICMEW), 1-4, 2015 | 7 | 2015 |
| Extensions of a MAT learner for regular tree languages F Drewes, J Högberg Swedish Artificial Intelligence Society-SAIS, 2006 | 7 | 2006 |
| Deterministic stack transducers S Bensch, J Björklund, M Kutrib International Journal of Foundations of Computer Science 28 (05), 583-601, 2017 | 6 | 2017 |
Frank DrewesDepartment of Computing Science, Umeå UniversityVerified email at cs.umu.se
