Szabolcs Iván

Publication Activity (10 Years)

Years Active: 2007-2022
Publications (10 Years): 22

Top Topics

Randomly Generated

Mind Change Complexity

Polynomially Solvable

Top Venues

Int. J. Found. Comput. Sci.

Publications

Kitti Gelle, Szabolcs Iván
Descriptive Complexity of Reversible Languages Having Finitely Many Reduced Automata. Int. J. Found. Comput. Sci. 33 (3&4) (2022)
Zsolt Gazdag, Károly Hajagos, Szabolcs Iván
On the power of P systems with active membranes using weak non-elementary membrane division. J. Membr. Comput. 3 (4) (2021)
Kitti Gelle, Szabolcs Iván
The Order Type of Scattered Context-Free Orderings of Rank One Is Computable. SOFSEM (2020)
Kitti Gelle, Szabolcs Iván
. CoRR (2020)
Zsolt Gazdag, Károly Hajagos, Szabolcs Iván
On the number of useful objects in P systems with active membranes. CoRR (2020)
Kitti Gelle, Szabolcs Iván
Recognizing Union-Find Trees is NP-Complete, Even Without Rank Info. Int. J. Found. Comput. Sci. 30 (6-7) (2019)
Kitti Gelle, Szabolcs Iván
The Syntactic Complexity of Semi-flower Languages. DCFS (2019)
Kitti Gelle, Szabolcs Iván
The order type of scattered context-free orderings of rank one is computable. CoRR (2019)
Kitti Gelle, Szabolcs Iván
The ordinal generated by an ordinal grammar is computable. Theor. Comput. Sci. 793 (2019)
Kitti Gelle, Szabolcs Iván
On the Order Type of Scattered Context-Free Orderings. GandALF (2019)
Kitti Gelle, Szabolcs Iván
The ordinal generated by an ordinal grammar is computable. CoRR (2018)
Kitti Gelle, Szabolcs Iván
Recognizing Union-Find trees is NP-complete. Inf. Process. Lett. 131 (2018)
Kitti Gelle, Szabolcs Iván
Maintaning maximal matching with lookahead. CoRR (2018)
Kitti Gelle, Szabolcs Iván
DFS is Unsparsable and Lookahead Can Help in Maximal Matching. Acta Cybern. 23 (3) (2018)
Kitti Gelle, Szabolcs Iván
Recognizing Union-Find trees built up using union-by-rank strategy is NP-complete. CoRR (2017)
Kitti Gelle, Szabolcs Iván
Regular Expressions for Muller Context-Free Languages. Acta Cybern. 23 (1) (2017)
Dmitry Chistikov, Szabolcs Iván, Anna Lubiw, Jeffrey O. Shallit
Fractional Coverings, Greedy Coverings, and Rectifier Networks. STACS (2017)
Kitti Gelle, Szabolcs Iván
Recognizing Union-Find Trees Built Up Using Union-By-Rank Strategy is NP-Complete. DCFS (2017)
Kitti Gelle, Szabolcs Iván
Reversible languages having finitely many reduced automata. AFL (2017)
Zoltán Ésik, Szabolcs Iván
MSO-definable Properties of Muller Context-Free Languages Are Decidable. DCFS (2016)
Szabolcs Iván
Complexity of atoms, combinatorially. Inf. Process. Lett. 116 (5) (2016)
Szabolcs Iván, Judit Nagy-György
On Nonpermutational Transformation Semigroups with an Application to Syntactic Complexity. Acta Cybern. 22 (3) (2016)
Kitti Gelle, Szabolcs Iván
Recognizing Union-Find trees is NP-complete. CoRR (2015)
Norbert Hantos, Szabolcs Iván, Péter Balázs, Kálmán Palágyi
Binary image reconstruction from a small number of projections and the morphological skeleton. Ann. Math. Artif. Intell. 75 (1-2) (2015)
Dmitry Chistikov, Szabolcs Iván, Anna Lubiw, Jeffrey O. Shallit
Fractional coverings, greedy coverings, and rectifier networks. CoRR (2015)
Szabolcs Iván
Algebraic characterization of temporal logics on forests. CoRR (2015)
Szabolcs Iván, Judit Nagy-György
On nonpermutational transformation semigroups with an application to syntactic complexity. CoRR (2014)
Szabolcs Iván, Ádám Dániel Lelkes, Judit Nagy-György, Balázs Szörényi, György Turán
Biclique Coverings, Rectifier Networks and the Cost of ε-Removal. DCFS (2014)
Szabolcs Iván
On state complexity of unions of binary factor-free languages. CoRR (2014)
Szabolcs Iván
Handle Atoms with Care. CoRR (2014)
Szabolcs Iván
Synchronizing weighted automata. AFL (2014)
Szabolcs Iván, Ádám Dániel Lelkes, Judit Nagy-György, Balázs Szörényi, György Turán
Biclique coverings, rectifier networks and the cost of $\varepsilon$-removal. CoRR (2014)
Zoltán Ésik, Szabolcs Iván
Operational Characterization of Scattered MCFLs. Int. J. Found. Comput. Sci. 25 (8) (2014)
Zoltán Ésik, Szabolcs Iván
Operational Characterization of Scattered MCFLs. Developments in Language Theory (2013)
Szabolcs Iván, Judit Nagy-György
On the structure and syntactic complexity of generalized definite languages CoRR (2013)
Zoltán Ésik, Szabolcs Iván
Operational characterization of scattered MCFLs -- Technical Report CoRR (2013)
Zoltán Ésik, Szabolcs Iván
On Müller context-free grammars. Theor. Comput. Sci. 416 (2012)
Zoltán Ésik, Szabolcs Iván
Hausdorff Rank of Scattered Context-Free Linear Orders. LATIN (2012)
Zoltán Ésik, Szabolcs Iván
Context-free ordinals CoRR (2011)
Zoltán Ésik, Szabolcs Iván
Büchi context-free languages. Theor. Comput. Sci. 412 (8-10) (2011)
Szabolcs Iván, Ágnes Mészáros
Müller context-free grammars generating well-ordered words. AFL (2011)
Zoltán Ésik, Szabolcs Iván
On Müller Context-Free Grammars. Developments in Language Theory (2010)
Zoltán Ésik, Szabolcs Iván
Context-Free Languages of Countable Words. ICTAC (2009)
Zsolt Gazdag, Szabolcs Iván, Judit Nagy-György
Improved upper bounds on synchronizing nondeterministic automata. Inf. Process. Lett. 109 (17) (2009)
Zoltán Ésik, Szabolcs Iván
Products of Tree Automata with an Application to Temporal Logic. Fundam. Informaticae 82 (1-2) (2008)
Zoltán Ésik, Szabolcs Iván
Games for Temporal Logics on Trees. CIAA (2008)
Zoltán Ésik, Szabolcs Iván
Some Varieties of Finite Tree Automata Related to Restricted Temporal Logics. Fundam. Informaticae 82 (1-2) (2008)
Zoltán Ésik, Szabolcs Iván
Aperiodicity in Tree Automata. CAI (2007)