Aperiodicity in Tree Automata. - Zoltán Ésik; Szabolcs Iván (CAI, 2007)

Games for Temporal Logics on Trees. - Zoltán Ésik; Szabolcs Iván (CIAA, 2008)

Products of Tree Automata with an Application to Temporal Logic. - Zoltán Ésik; Szabolcs Iván (Fundam. Informaticae, 2008)

Some Varieties of Finite Tree Automata Related to Restricted Temporal Logics. - Zoltán Ésik; Szabolcs Iván (Fundam. Informaticae, 2008)

Context-Free Languages of Countable Words. - Zoltán Ésik; Szabolcs Iván (ICTAC, 2009)

Improved upper bounds on synchronizing nondeterministic automata. - Zsolt Gazdag; Szabolcs Iván; Judit Nagy-György (Inf. Process. Lett., 2009)

Müller context-free grammars generating well-ordered words. - Szabolcs Iván; Ágnes Mészáros (AFL, 2011)

Context-free ordinals - Zoltán Ésik; Szabolcs Iván (CoRR, 2011)

Büchi context-free languages. - Zoltán Ésik; Szabolcs Iván (Theor. Comput. Sci., 2011)

Hausdorff Rank of Scattered Context-Free Linear Orders. - Zoltán Ésik; Szabolcs Iván (LATIN, 2012)

On Müller context-free grammars. - Zoltán Ésik; Szabolcs Iván (Theor. Comput. Sci., 2012)

On the structure and syntactic complexity of generalized definite languages - Szabolcs Iván; Judit Nagy-György (CoRR, 2013)

Operational characterization of scattered MCFLs – Technical Report - Zoltán Ésik; Szabolcs Iván (CoRR, 2013)

Biclique Coverings, Rectifier Networks and the Cost of ε-Removal. - Szabolcs Iván; Ádám Dániel Lelkes; Judit Nagy-György; Balázs Szörényi; György Turán (DCFS, 2014)

Synchronizing weighted automata. - Szabolcs Iván (AFL, 2014)

Handle Atoms with Care. - Szabolcs Iván (CoRR, 2014)

On state complexity of unions of binary factor-free languages. - Szabolcs Iván (CoRR, 2014)

Biclique coverings, rectifier networks and the cost of $ varepsilon$-removal. - Szabolcs Iván; Ádám Dániel Lelkes; Judit Nagy-György; Balázs Szörényi; György Turán (CoRR, 2014)

Operational Characterization of Scattered MCFLs. - Zoltán Ésik; Szabolcs Iván (Int. J. Found. Comput. Sci., 2014)

Binary image reconstruction from a small number of projections and the morphological skeleton. - Norbert Hantos; Szabolcs Iván; Péter Balázs; Kálmán Palágyi (Ann. Math. Artif. Intell., 2015)

Algebraic characterization of temporal logics on forests. - Szabolcs Iván (CoRR, 2015)

MSO-definable Properties of Muller Context-Free Languages Are Decidable. - Zoltán Ésik; Szabolcs Iván (DCFS, 2016)

On Nonpermutational Transformation Semigroups with an Application to Syntactic Complexity. - Szabolcs Iván; Judit Nagy-György (Acta Cybern., 2016)

Complexity of atoms, combinatorially. - Szabolcs Iván (Inf. Process. Lett., 2016)

Recognizing Union-Find Trees Built Up Using Union-By-Rank Strategy is NP-Complete. - Kitti Gelle; Szabolcs Iván (DCFS, 2017)

Fractional Coverings, Greedy Coverings, and Rectifier Networks. - Dmitry Chistikov 001; Szabolcs Iván; Anna Lubiw; Jeffrey O. Shallit (STACS, 2017)

Regular Expressions for Muller Context-Free Languages. - Kitti Gelle; Szabolcs Iván (Acta Cybern., 2017)

Reversible languages having finitely many reduced automata. - Kitti Gelle; Szabolcs Iván (AFL, 2017)

DFS is Unsparsable and Lookahead Can Help in Maximal Matching. - Kitti Gelle; Szabolcs Iván (Acta Cybern., 2018)

Maintaning maximal matching with lookahead. - Kitti Gelle; Szabolcs Iván (CoRR, 2018)

Recognizing Union-Find trees is NP-complete. - Kitti Gelle; Szabolcs Iván (Inf. Process. Lett., 2018)

The Syntactic Complexity of Semi-flower Languages. - Kitti Gelle; Szabolcs Iván (DCFS, 2019)

On the Order Type of Scattered Context-Free Orderings. - Kitti Gelle; Szabolcs Iván (GandALF, 2019)

Recognizing Union-Find Trees is NP-Complete, Even Without Rank Info. - Kitti Gelle; Szabolcs Iván (Int. J. Found. Comput. Sci., 2019)

The ordinal generated by an ordinal grammar is computable. - Kitti Gelle; Szabolcs Iván (Theor. Comput. Sci., 2019)

The Order Type of Scattered Context-Free Orderings of Rank One Is Computable. - Kitti Gelle; Szabolcs Iván (SOFSEM, 2020)

Scattered one-counter languges have rank less than ω2. - Kitti Gelle; Szabolcs Iván (CoRR, 2020)

On the number of useful objects in P systems with active membranes. - Zsolt Gazdag; Károly Hajagos; Szabolcs Iván (CoRR, 2020)

On the power of P systems with active membranes using weak non-elementary membrane division. - Zsolt Gazdag; Károly Hajagos; Szabolcs Iván (J. Membr. Comput., 2021)

Descriptive Complexity of Reversible Languages Having Finitely Many Reduced Automata. - Kitti Gelle; Szabolcs Iván (Int. J. Found. Comput. Sci., 2022)