×
Author ID: ivan.szabolcs Recent zbMATH articles by "Iván, Szabolcs"
Published as: Iván, Szabolcs; Iván, Sz.

Citations contained in zbMATH Open

20 Publications have been cited 59 times in 52 Documents Cited by Year
Complexity of atoms, combinatorially. Zbl 1352.68130
Iván, Szabolcs
17
2016
Improved upper bounds on synchronizing nondeterministic automata. Zbl 1200.68140
Gazdag, Zsolt; Iván, Szabolcs; Nagy-György, Judit
9
2009
Büchi context-free languages. Zbl 1206.68171
Ésik, Zoltán; Iván, Szabolcs
5
2011
On Müller context-free grammars. Zbl 1232.68079
Ésik, Zoltán; Iván, Szabolcs
3
2012
On nonpermutational transformation semigroups with an application to syntactic complexity. Zbl 1363.20059
Iván, Szabolcs; Nagy-György, Judit
3
2016
Hausdorff rank of scattered context-free linear orders. Zbl 1318.68106
Ésik, Zoltán; Iván, Szabolcs
2
2012
Context-free languages of countable words. Zbl 1250.68154
Ésik, Zoltán; Iván, Szabolcs
2
2009
Products of tree automata with an application to temporal logic. Zbl 1136.68037
Ésik, Zoltán; Iván, Szabolcs
2
2008
Some varieties of finite tree automata related to restricted temporal logics. Zbl 1136.68038
Ésik, Zoltán; Iván, Szabolcs
2
2008
Reversible languages having finitely many reduced automata. Zbl 1483.68170
Gelle, Kitti; Iván, Szabolcs
2
2017
Synchronizing weighted automata. Zbl 1464.68172
Iván, Szabolcs
2
2014
The ordinal generated by an ordinal grammar is computable. Zbl 1430.68135
Gelle, Kitti; Iván, Szabolcs
2
2019
Aperiodicity in tree automata. Zbl 1148.68399
Ésik, Zoltan; Iván, Szabolcs
1
2007
On Müller context-free grammars. Zbl 1250.68140
Ésik, Zoltán; Iván, Szabolcs
1
2010
On the order type of scattered context-free orderings. Zbl 1543.68151
Gelle, Kitti; Iván, Szabolcs
1
2019
On the power of P systems with active membranes using weak non-elementary membrane division. Zbl 1490.68098
Gazdag, Zsolt; Hajagos, Károly; Iván, Szabolcs
1
2021
Recognizing union-find trees is NP-complete, even without rank info. Zbl 1427.68059
Gelle, Kitti; Iván, Szabolcs
1
2019
Recognizing union-find trees built up using union-by-rank strategy is NP-complete. Zbl 1426.68070
Gelle, Kitti; Iván, Szabolcs
1
2017
Recognizing union-find trees is NP-complete. Zbl 1423.68191
Gelle, Kitti; Iván, Szabolcs
1
2018
Fractional coverings, greedy coverings, and rectifier networks. Zbl 1402.68086
Chistikov, Dmitry; Iván, Szabolcs; Lubiw, Anna; Shallit, Jeffrey
1
2017
On the power of P systems with active membranes using weak non-elementary membrane division. Zbl 1490.68098
Gazdag, Zsolt; Hajagos, Károly; Iván, Szabolcs
1
2021
The ordinal generated by an ordinal grammar is computable. Zbl 1430.68135
Gelle, Kitti; Iván, Szabolcs
2
2019
On the order type of scattered context-free orderings. Zbl 1543.68151
Gelle, Kitti; Iván, Szabolcs
1
2019
Recognizing union-find trees is NP-complete, even without rank info. Zbl 1427.68059
Gelle, Kitti; Iván, Szabolcs
1
2019
Recognizing union-find trees is NP-complete. Zbl 1423.68191
Gelle, Kitti; Iván, Szabolcs
1
2018
Reversible languages having finitely many reduced automata. Zbl 1483.68170
Gelle, Kitti; Iván, Szabolcs
2
2017
Recognizing union-find trees built up using union-by-rank strategy is NP-complete. Zbl 1426.68070
Gelle, Kitti; Iván, Szabolcs
1
2017
Fractional coverings, greedy coverings, and rectifier networks. Zbl 1402.68086
Chistikov, Dmitry; Iván, Szabolcs; Lubiw, Anna; Shallit, Jeffrey
1
2017
Complexity of atoms, combinatorially. Zbl 1352.68130
Iván, Szabolcs
17
2016
On nonpermutational transformation semigroups with an application to syntactic complexity. Zbl 1363.20059
Iván, Szabolcs; Nagy-György, Judit
3
2016
Synchronizing weighted automata. Zbl 1464.68172
Iván, Szabolcs
2
2014
On Müller context-free grammars. Zbl 1232.68079
Ésik, Zoltán; Iván, Szabolcs
3
2012
Hausdorff rank of scattered context-free linear orders. Zbl 1318.68106
Ésik, Zoltán; Iván, Szabolcs
2
2012
Büchi context-free languages. Zbl 1206.68171
Ésik, Zoltán; Iván, Szabolcs
5
2011
On Müller context-free grammars. Zbl 1250.68140
Ésik, Zoltán; Iván, Szabolcs
1
2010
Improved upper bounds on synchronizing nondeterministic automata. Zbl 1200.68140
Gazdag, Zsolt; Iván, Szabolcs; Nagy-György, Judit
9
2009
Context-free languages of countable words. Zbl 1250.68154
Ésik, Zoltán; Iván, Szabolcs
2
2009
Products of tree automata with an application to temporal logic. Zbl 1136.68037
Ésik, Zoltán; Iván, Szabolcs
2
2008
Some varieties of finite tree automata related to restricted temporal logics. Zbl 1136.68038
Ésik, Zoltán; Iván, Szabolcs
2
2008
Aperiodicity in tree automata. Zbl 1148.68399
Ésik, Zoltan; Iván, Szabolcs
1
2007

Citations by Year