| Improved upper bounds on synchronizing nondeterministic automata Z Gazdag, S Iván, J Nagy-György Information Processing Letters 109 (17), 986-990, 2009 | 36 | 2009 |
| A new approach for solving SAT by P systems with active membranes Z Gazdag, G Kolonits International Conference on Membrane Computing, 195-207, 2012 | 26 | 2012 |
| Hierarchies of tree series transformations Z Fülöp, Z Gazdag, H Vogler Theoretical computer science 314 (3), 387-429, 2004 | 20 | 2004 |
| A new method to simulate restricted variants of polarizationless P systems with active membranes Z Gazdag, G Kolonits Journal of Membrane Computing 1 (4), 251-261, 2019 | 19 | 2019 |
| Solving SAT by P systems with active membranes in linear time in the number of variables Z Gazdag Membrane Computing: 14th International Conference, CMC 2013, Chişinău …, 2014 | 18 | 2014 |
| Bounds for tree automata with polynomial costs B Borchardt, Z Fülöp, Z Gazdag, A Maletti J. Autom. Lang. Comb. 10 (2/3), 107-157, 2005 | 9 | 2005 |
| Remarks on the computational power of some restricted variants of P systems with active membranes Z Gazdag, G Kolonits International Conference on Membrane Computing, 209-232, 2016 | 7 | 2016 |
| On the power of permitting semi-conditional grammars Z Gazdag, K Tichler International Conference on Developments in Language Theory, 173-184, 2017 | 6 | 2017 |
| Decidability of the shape preserving property of bottom-up tree transducers Z Gazdag International Journal of Foundations of Computer Science 17 (02), 395-413, 2006 | 6 | 2006 |
| Simulating Turing machines with polarizationless P systems with active membranes Z Gazdag, G Kolonits, MA Gutiérrez-Naranjo International Conference on Membrane Computing, 229-240, 2014 | 5 | 2014 |
| Shape preserving top-down tree transducers Z Fülöp, Z Gazdag Theoretical computer science 304 (1-3), 315-339, 2003 | 5 | 2003 |
| On the power of P systems with active membranes using weak non-elementary membrane division Z Gazdag, K Hajagos, S Iván Journal of Membrane Computing 3 (4), 258-269, 2021 | 4 | 2021 |
| Solving the ST-connectivity problem with pure membrane computing techniques Z Gazdag, MA Gutiérrez-Naranjo International Conference on Membrane Computing, 215-228, 2014 | 4 | 2014 |
| A note on context-free grammars with rewriting restrictions Z Gazdag matcos, 2011 | 4 | 2011 |
| Shape preserving bottom-up tree transducers A We CONFERENCE OF PHD STUDENTS IN COMPUTER SCIENCE, 44, 2004 | 4 | 2004 |
| Remarks on some simple variants of random context grammars Z Gazdag Journal of Automata, Languages and Combinatorics 19 (1), 81-92, 2014 | 3 | 2014 |
| On the power of membrane dissolution in polarizationless P systems with active membranes Z Gazdag, K Hajagos Natural Computing 22 (1), 95-104, 2023 | 2 | 2023 |
| Weighted languages recognizable by weighted tree automata Z Fülöp, Z Gazdag Acta Cybernetica 23 (3), 867-886, 2018 | 2 | 2018 |
| A Characterization of PSPACE with Antimatter and Membrane Creation Z Gazdag, MÁ Gutiérrez Naranjo Proceedings of the Thirteenth Brainstorming Week on Membrane Computing, 159 …, 2015 | 2 | 2015 |
| A kleene theorem for bisemigroup and binoid languages Z Gazdag, ZL Németh International Journal of Foundations of Computer Science 22 (02), 427-446, 2011 | 2 | 2011 |
