Szabolcs Iván

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