Szabolcs Iván
Szabolcs Iván
Assistant Professor of Computer Science, University of Szeged
Verified email at inf.u-szeged.hu - Homepage
TitleCited byYear
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
Complexity of atoms, combinatorially
S Iván
Information Processing Letters 116 (5), 356-360, 2016
212016
Improved upper bounds on synchronizing nondeterministic automata
Z Gazdag, S Iván, J Nagy-György
Information Processing Letters 109 (17), 986-990, 2009
182009
Products of tree automata with an application to temporal logic
Z Ésik, S Iván
Fundamenta Informaticae 82 (1-2), 61-78, 2008
162008
Büchi context-free languages
Z Ésik, S Iván
Theoretical Computer Science 412 (8-10), 805-821, 2011
132011
On Müller context-free grammars
Z Ésik, S Iván
Theoretical Computer Science 416, 17-32, 2012
72012
Hausdorff rank of scattered context-free linear orders
Z Ésik, S Iván
Latin American Symposium on Theoretical Informatics, 291-302, 2012
62012
On nonpermutational transformation semigroups with an application to syntactic complexity
S Iván, J Nagy-Gyorgy
arXiv preprint arXiv:1402.7289, 2014
52014
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
Games for temporal logics on trees
Z Ésik, S Iván
International Conference on Implementation and Application of Automata, 191-200, 2008
42008
Aperiodicity in tree automata
Z Ésik, S Iván
International Conference on Algebraic Informatics, 189-207, 2007
42007
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
Recognizing Union-Find trees is NP-complete
K Gelle, S Iván
Information Processing Letters 131, 7-14, 2018
12018
DFS is unsparsable and lookahead can help in maximal matching
K Gelle, S Iván
Acta Cybernetica 23 (3), 887-902, 2018
12018
Recognizing Union-Find trees built up using union-by-rank strategy is NP-complete
K Gelle, S Iván
International Conference on Descriptional Complexity of Formal Systems, 152-163, 2017
12017
MSO-definable Properties of Muller Context-Free Languages Are Decidable
Z Ésik, S Iván
International Conference on Descriptional Complexity of Formal Systems, 87-97, 2016
12016
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
12015
The system can't perform the operation now. Try again later.
Articles 1–20