Szabolcs Iván
Szabolcs Iván
Assistant Professor of Computer Science, University of Szeged
Verified email at inf.u-szeged.hu - Homepage
TitleCited byYear
Complexity of atoms, combinatorially
S Iván
Information Processing Letters 116 (5), 356-360, 2016
222016
Some varieties of finite tree automata related to restricted temporal logics
Z Ésik, S Iván
Fundamenta Informaticae 82 (1-2), 79-103, 2008
222008
Improved upper bounds on synchronizing nondeterministic automata
Z Gazdag, S Iván, J Nagy-György
Information Processing Letters 109 (17), 986-990, 2009
212009
Products of tree automata with an application to temporal logic
Z Ésik, S Iván
Fundamenta Informaticae 82 (1-2), 61-78, 2008
152008
Büchi context-free languages
Z Ésik, S Iván
Theoretical Computer Science 412 (8-10), 805-821, 2011
142011
Hausdorff rank of scattered context-free linear orders
Z Ésik, S Iván
Latin American Symposium on Theoretical Informatics, 291-302, 2012
82012
On Müller context-free grammars
Z Ésik, S Iván
Theoretical Computer Science 416, 17-32, 2012
72012
On nonpermutational transformation semigroups with an application to syntactic complexity
S Iván, J Nagy-Gyorgy
arXiv preprint arXiv:1402.7289, 2014
62014
On Müller context-free grammars
Z Ésik, S Iván
International Conference on Developments in Language Theory, 173-184, 2010
52010
Synchronizing weighted automata
S Iván
arXiv preprint arXiv:1403.5729, 2014
42014
Context-free languages of countable words
Z Ésik, S Iván
International Colloquium on Theoretical Aspects of Computing, 185-199, 2009
42009
Aperiodicity in tree automata
Z Ésik, S Iván
International Conference on Algebraic Informatics, 189-207, 2007
42007
The ordinal generated by an ordinal grammar is computable
K Gelle, S Iván
Theoretical Computer Science 793, 1-13, 2019
32019
Games for temporal logics on trees
Z Ésik, S Iván
International Conference on Implementation and Application of Automata, 191-200, 2008
32008
On the order type of scattered context-free orderings
K Gelle, S Iván
arXiv preprint arXiv:1909.08543, 2019
22019
Recognizing Union-Find trees is NP-complete
K Gelle, S Iván
Information Processing Letters 131, 7-14, 2018
22018
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 (1-2), 195-216, 2015
22015
Fractional coverings, greedy coverings, and rectifier networks
D Chistikov, S Iván, A Lubiw, J Shallit
arXiv preprint arXiv:1509.07588, 2015
22015
Müller context-free grammars generating well-ordered words.
S Iván, Á Mészáros
AFL, 225-240, 2011
22011
The order type of scattered context-free orderings of rank one is computable
K Gelle, S Iván
International Conference on Current Trends in Theory and Practice of …, 2020
12020
The system can't perform the operation now. Try again later.
Articles 1–20