| Improved upper bounds on synchronizing nondeterministic automata Z Gazdag, S Iván, J Nagy-György Information Processing Letters 109 (17), 986-990, 2009 | 34 | 2009 |
| Complexity of atoms, combinatorially S Iván Information Processing Letters 116 (5), 356-360, 2016 | 28 | 2016 |
| Some varieties of finite tree automata related to restricted temporal logics Z Ésik, S Iván Fundamenta Informaticae 82 (1-2), 79-103, 2008 | 20 | 2008 |
| Büchi context-free languages Z Ésik, S Iván Theoretical Computer Science 412 (8-10), 805-821, 2011 | 16 | 2011 |
| Products of tree automata with an application to temporal logic Z Ésik, S Iván Fundamenta Informaticae 82 (1-2), 61-78, 2008 | 15 | 2008 |
| On Müller context-free grammars Z Ésik, S Iván Theoretical Computer Science 416, 17-32, 2012 | 11 | 2012 |
| Hausdorff rank of scattered context-free linear orders Z Ésik, S Iván Latin American Symposium on Theoretical Informatics, 291-302, 2012 | 9 | 2012 |
| Synchronizing weighted automata S Iván arXiv preprint arXiv:1403.5729, 2014 | 8 | 2014 |
| Aperiodicity in tree automata Z Ésik, S Iván International Conference on Algebraic Informatics, 189-207, 2007 | 7 | 2007 |
| Binary image reconstruction from a small number of projections and the morphological skeleton N Hantos, S Iván, P Balázs, K Palágyi Annals of Mathematics and Artificial Intelligence 75, 195-216, 2015 | 6 | 2015 |
| Fractional coverings, greedy coverings, and rectifier networks D Chistikov, S Iván, A Lubiw, J Shallit arXiv preprint arXiv:1509.07588, 2015 | 6 | 2015 |
| On nonpermutational transformation semigroups with an application to syntactic complexity S Iván, J Nagy-Gyorgy arXiv preprint arXiv:1402.7289, 2014 | 6 | 2014 |
| The ordinal generated by an ordinal grammar is computable K Gelle, S Iván Theoretical Computer Science 793, 1-13, 2019 | 4 | 2019 |
| On the power of P systems with active membranes using weak non-elementary membrane division Z Gazdag, K Hajagos, S Iván Journal of Membrane Computing 3 (4), 258-269, 2021 | 3 | 2021 |
| On the order type of scattered context-free orderings K Gelle, S Iván arXiv preprint arXiv:1909.08543, 2019 | 3 | 2019 |
| Recognizing Union-Find trees is NP-complete K Gelle, S Iván Information Processing Letters 131, 7-14, 2018 | 3 | 2018 |
| Reversible languages having finitely many reduced automata K Gelle, S Iván arXiv preprint arXiv:1705.10533, 2017 | 3 | 2017 |
| Context-free languages of countable words Z Ésik, S Iván International Colloquium on Theoretical Aspects of Computing, 185-199, 2009 | 3 | 2009 |
| Games for temporal logics on trees Z Ésik, S Iván International Conference on Implementation and Application of Automata, 191-200, 2008 | 3 | 2008 |
| Learning and recognizing noun phrases in Proceedings of the Hungarian Computational Linguistics Conference (MSZNY 2003) A Hócza, S Iván Szeged, Hungary, 72-79, 2003 | 3 | 2003 |
Norbert HantosUniversity of SzegedVerified email at inf.u-szeged.hu
