default search action
Zsolt Gazdag
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2023
- [j15]Zsolt Gazdag, Sándor Vágvölgyi:
The Component Hierarchy of Chain-Free Cooperating Distributed Regular Tree Grammars Revisited. Int. J. Found. Comput. Sci. 34(4): 411-427 (2023) - [j14]Zsolt Gazdag
, Károly Hajagos:
On the power of membrane dissolution in polarizationless P systems with active membranes. Nat. Comput. 22(1): 95-104 (2023) - [j13]Zsolt Gazdag
A characterisation of P by DLOGTIME-uniform families of polarizationless P systems using only dissolution rules. Theor. Comput. Sci. 965: 113974 (2023) - [e1]Zsolt Gazdag, Szabolcs Iván, Gergely Kovásznai:
Proceedings of the 16th International Conference on Automata and Formal Languages, AFL 2023, Eger, Hungary, September 5-7, 2023. EPTCS 386, 2023 [contents] - 2021
- [j12]Zsolt Gazdag
On the power of P systems with active membranes using weak non-elementary membrane division. J. Membr. Comput. 3(4): 258-269 (2021) - 2020
- [i1]Zsolt Gazdag, Károly Hajagos, Szabolcs Iván:
On the number of useful objects in P systems with active membranes. CoRR abs/2008.04993 (2020)
2010 – 2019
- 2019
- [j11]Zsolt Gazdag, Krisztián Tichler, Erzsébet Csuhaj-Varjú:
A Pumping Lemma for Permitting Semi-Conditional Languages. Int. J. Found. Comput. Sci. 30(1): 73-92 (2019) - [j10]Zsolt Gazdag
A new method to simulate restricted variants of polarizationless P systems with active membranes. J. Membr. Comput. 1(4): 251-261 (2019) - 2018
- [j9]Zoltán Fülöp
Weighted Languages Recognizable by Weighted Tree Automata. Acta Cybern. 23(3): 867-886 (2018) - 2017
- [c7]Zsolt Gazdag, Krisztián Tichler:
On the Power of Permitting Semi-conditional Grammars. DLT 2017: 173-184 - 2016
- [c6]Zsolt Gazdag, Gábor Kolonits:
Remarks on the Computational Power of Some Restricted Variants of P Systems with Active Membranes. Int. Conf. on Membrane Computing 2016: 209-232 - 2014
- [j8]Zsolt Gazdag:
Remarks on some Simple Variants of Random Context Grammars. J. Autom. Lang. Comb. 19(1-4): 81-92 (2014) - [c5]Zsolt Gazdag, Miguel A. Gutiérrez-Naranjo
Solving the ST-Connectivity Problem with Pure Membrane Computing Techniques. Int. Conf. on Membrane Computing 2014: 215-228 - [c4]Zsolt Gazdag, Gábor Kolonits, Miguel A. Gutiérrez-Naranjo
Simulating Turing Machines with Polarizationless P Systems with Active Membranes. Int. Conf. on Membrane Computing 2014: 229-240 - 2013
- [c3]Zsolt Gazdag:
Solving SAT by P Systems with Active Membranes in Linear Time in the Number of Variables. Int. Conf. on Membrane Computing 2013: 189-205 - 2012
- [c2]Zsolt Gazdag, Gábor Kolonits:
A New Approach for Solving SAT by P Systems with Active Membranes. Int. Conf. on Membrane Computing 2012: 195-207 - 2011
- [j7]Zsolt Gazdag, Zoltán L. Németh:
A Kleene Theorem for Bisemigroup and binoid Languages. Int. J. Found. Comput. Sci. 22(2): 427-446 (2011)
2000 – 2009
- 2009
- [j6]Zsolt Gazdag, Szabolcs Iván
Improved upper bounds on synchronizing nondeterministic automata. Inf. Process. Lett. 109(17): 986-990 (2009) - 2008
- [c1]Zsolt Gazdag, Zoltán L. Németh:
A Kleene Theorem for Binoid Languages. AFL 2008: 170-182 - 2006
- [j5]Zsolt Gazdag:
Decidability of the Shape Preserving Property of Bottom-up Tree Transducers. Int. J. Found. Comput. Sci. 17(2): 395-414 (2006) - 2005
- [j4]Björn Borchardt, Zoltán Fülöp, Zsolt Gazdag, Andreas Maletti:
Bounds for Tree Automata with Polynomial Costs. J. Autom. Lang. Comb. 10(2/3): 107-157 (2005) - [j3]Zsolt Gazdag:
Shape Preserving Bottom-Up Tree Transducers. J. Autom. Lang. Comb. 10(4): 483-534 (2005) - 2004
- [j2]Zoltán Fülöp, Zsolt Gazdag, Heiko Vogler:
Hierarchies of tree series transformations. Theor. Comput. Sci. 314(3): 387-429 (2004) - 2003
- [j1]Zoltán Fülöp, Zsolt Gazdag:
Shape preserving top-down tree transducers. Theor. Comput. Sci. 304(1-3): 315-339 (2003)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from ,
, and
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and
to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from .
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-04-24 23:17 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by: