default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDZoltán Fülöp 0001
Person information
- affiliation: University of Szeged, Department of Foundations of Computer Science, Szeged, Hungary
Other persons with the same name
- Zoltán Fülöp 0002 — Budapest University of Technology and Economics, Hungary
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
showing all ?? records
2020 – today
- 2024
[j72]Frederic Dörband, Zoltán Fülöp, Heiko Vogler:
Rational weighted tree languages with storage. Inf. Comput. 301: 105205 (2024)- [j71]Zoltán Fülöp, George Rahonis, Kai Salomaa:
Special Issue: Articles Dedicated to the Memory of Magnus Steinby - Preface. Int. J. Found. Comput. Sci. 35(1&2): 1 (2024) - [j70]Zoltán Fülöp, Heiko Vogler:
A Comparison of Sets of Recognizable Weighted Tree Languages Over Specific Sets of Bounded Lattices. Int. J. Found. Comput. Sci. 35(1&2): 51-76 (2024) - [i8]Manfred Droste, Zoltán Fülöp, Andreja Tepavcevic, Heiko Vogler:
The generating power of weighted tree automata with initial algebra semantics. CoRR abs/2405.20753 (2024) - 2023
- [j69]Manfred Droste, Zoltán Fülöp, Dávid Kószó:
Decidability Boundaries for the Finite-Image Property of Weighted Finite Automata. Int. J. Found. Comput. Sci. 34(6): 633-653 (2023) - 2022
- [j68]Zoltán Fülöp, Heiko Vogler:
Principal abstract families of weighted tree languages. Inf. Comput. 282: 104657 (2022) - [j67]Manfred Droste, Zoltán Fülöp
, Dávid Kószó, Heiko Vogler:
Finite-image property of weighted tree automata over past-finite monotonic strong bimonoids. Theor. Comput. Sci. 919: 118-143 (2022) - [i7]Zoltán Fülöp, Heiko Vogler:
Weighted Tree Automata - May it be a little more? CoRR abs/2212.05529 (2022) - 2021
- [j66]Zoltán Fülöp, Dávid Kószó, Heiko Vogler:
Crisp-determinization of weighted tree automata over strong bimonoids. Discret. Math. Theor. Comput. Sci. 23(1) (2021) - [i6]Manfred Droste, Zoltán Fülöp, Dávid Kószó, Heiko Vogler:
Finite-image property of weighted tree automata over past-finite monotonic strong bimonoids. CoRR abs/2106.15867 (2021) - 2020
- [c13]Manfred Droste, Zoltán Fülöp, Dávid Kószó, Heiko Vogler:
Crisp-Determinization of Weighted Tree Automata over Additively Locally Finite and Past-Finite Monotonic Strong Bimonoids Is Decidable. DCFS 2020: 39-51
2010 – 2019
- 2019
- [j65]Zoltán Fülöp, Heiko Vogler:
Weighted iterated linear control. Acta Informatica 56(5): 447-469 (2019) - [j64]Doreen Götze, Zoltán Fülöp, Manfred Droste:
A Kleene theorem for weighted tree automata over tree valuation monoids. Inf. Comput. 269 (2019) - [c12]Zoltán Fülöp, Heiko Vogler:
Rational Weighted Tree Languages with Storage and the Kleene-Goldstine Theorem. CAI 2019: 138-150 - [c11]Zoltán Fülöp, Andreas Maletti:
Composition Closure of Linear Weighted Extended Top-Down Tree Transducers. CIAA 2019: 133-145 - [i5]Zoltán Fülöp, Dávid Kószó, Heiko Vogler:
Crisp-determinization of weighted tree automata over strong bimonoids. CoRR abs/1912.02660 (2019) - 2018
- [j63]Zoltán Fülöp, Zsolt Gazdag:
Weighted Languages Recognizable by Weighted Tree Automata. Acta Cybern. 23(3): 867-886 (2018) - [j62]Zoltán Fülöp, Luisa Herrmann, Heiko Vogler:
Weighted Regular Tree Grammars with Storage. Discret. Math. Theor. Comput. Sci. 20(1) (2018) - [j61]Zoltán Fülöp, Heiko Vogler:
Characterizations of recognizable weighted tree languages by logic and bimorphisms. Soft Comput. 22(4): 1035-1046 (2018) - 2017
- [j60]Zoltán Fülöp:
Preface. Acta Cybern. 23(1): 1 (2017) - [j59]Zoltán Fülöp:
In Memoriam Zoltán Ésik. Acta Cybern. 23(1): 3-7 (2017) - [j58]Zoltán Fülöp, Sándor Vágvölgyi:
Minimization of Deterministic Top-down Tree Automata. Acta Cybern. 23(1): 379-401 (2017) - [j57]Zoltán Fülöp:
In Memoriam Zoltán Ésik (1951-2016). Int. J. Found. Comput. Sci. 28(5): 441-444 (2017) - [j56]Joost Engelfriet, Zoltán Fülöp, Andreas Maletti:
Composition Closure of Linear Extended Top-down Tree Transducers. Theory Comput. Syst. 60(2): 129-171 (2017) - [i4]Zoltán Fülöp, Luisa Herrmann, Heiko Vogler:
Weighted Regular Tree Grammars with Storage. CoRR abs/1705.06681 (2017) - 2016
- [j55]Zoltán Fülöp, Andreas Maletti:
Linking theorems for tree transducers. J. Comput. Syst. Sci. 82(7): 1201-1222 (2016) - [c10]Manfred Droste, Zoltán Fülöp, Doreen Götze:
A Kleene Theorem for Weighted Tree Automata over Tree Valuation Monoids. LATA 2016: 452-463 - [c9]Zoltán Fülöp:
Weighted tree automata and their characterization by logic - a summary. NCMA 2016: 41-46 - 2015
- [j54]Zoltán Ésik, Zoltán Fülöp:
In Memory of Professor Ferenc Gécseg. Acta Cybern. 22(2): 243-246 (2015) - [j53]Zoltán Fülöp:
Local Weighted Tree Languages. Acta Cybern. 22(2): 393-402 (2015) - [j52]Zoltán Fülöp, Heiko Vogler:
Characterizing weighted MSO for trees by branching transitive closure logics. Theor. Comput. Sci. 594: 82-105 (2015) - 2014
- [j51]Zoltán Fülöp, Heiko Vogler:
Forward and backward application of symbolic tree transducers. Acta Informatica 51(5): 297-325 (2014) - [e4]Zoltán Ésik, Zoltán Fülöp:
Proceedings 14th International Conference on Automata and Formal Languages, AFL 2014, Szeged, Hungary, May 27-29, 2014. EPTCS 151, 2014 [contents] - 2013
- [c8]Zoltán Fülöp, Andreas Maletti:
Composition Closure of ε-Free Linear Extended Top-Down Tree Transducers. Developments in Language Theory 2013: 239-251 - [i3]Zoltán Fülöp, Andreas Maletti:
Composition Closure of Linear Extended Top-down Tree Transducers. CoRR abs/1301.1514 (2013) - 2012
- [j50]Symeon Bozapalidis, Zoltán Fülöp, George Rahonis:
Equational weighted tree transformations. Acta Informatica 49(1): 29-52 (2012) - [j49]Zoltán Fülöp, Torsten Stüber, Heiko Vogler:
A Büchi-Like Theorem for Weighted Tree Automata over Multioperator Monoids. Theory Comput. Syst. 50(2): 241-278 (2012) - [i2]Zoltán Fülöp, Heiko Vogler:
Characterizing Weighted MSO for Trees by Branching Transitive Closure Logics. CoRR abs/1208.5317 (2012) - [i1]Zoltán Fülöp, Heiko Vogler:
Forward and Backward Application of Symbolic Tree Transducers. CoRR abs/1208.5324 (2012) - 2011
- [j48]Zoltán Fülöp, Andreas Maletti, Heiko Vogler:
Weighted Extended Tree Transducers. Fundam. Informaticae 111(2): 163-202 (2011) - [j47]Zoltán Fülöp, Magnus Steinby:
Varieties of recognizable tree series over fields. Theor. Comput. Sci. 412(8-10): 736-752 (2011) - [j46]Symeon Bozapalidis, Zoltán Fülöp, George Rahonis:
Equational tree transformations. Theor. Comput. Sci. 412(29): 3676-3692 (2011) - [c7]Zoltán Fülöp, George Rahonis:
Equational Weighted Tree Transformations with Discounting. Algebraic Foundations in Computer Science 2011: 112-145 - 2010
- [c6]Zoltán Fülöp, Andreas Maletti, Heiko Vogler:
Preservation of Recognizability for Synchronous Tree Substitution Grammars. ATANLP@ACL 2010 2010: 1-9
2000 – 2009
- 2009
- [j45]Zoltán Fülöp, Lorand Muzamel:
Weighted Tree-Walking Automata. Acta Cybern. 19(2): 275-293 (2009) - [j44]Torsten Stüber, Heiko Vogler, Zoltán Fülöp:
Decomposition of Weighted multioperator Tree Automata. Int. J. Found. Comput. Sci. 20(2): 221-245 (2009) - [j43]Zoltán Fülöp, Andreas Maletti, Heiko Vogler:
A Kleene Theorem for Weighted Tree Automata over Distributive Multioperator Monoids. Theory Comput. Syst. 44(3): 455-499 (2009) - [c5]Zoltán Fülöp, Magnus Steinby:
Formal Series of General Algebras over a Field and Their Syntactic Algebras. Automata, Formal Languages, and Related Topics 2009: 55-78 - [e3]Zoltán Ésik, Zoltán Fülöp:
Automata, Formal Languages, and Related Topics - Dedicated to Ferenc Gécseg on the occasion of his 70th birthday. Institute of Informatics, University of Szeged, Hungary 2009, ISBN 978-963-482-916-4 [contents] - 2008
- [j42]Zoltán Fülöp, Lorand Muzamel:
Pebble Macro Tree Transducers with Strong Pebble Handling. Fundam. Informaticae 89(2-3): 207-257 (2008) - [j41]Zoltán Fülöp, Lorand Muzamel:
Circularity, Composition, and Decomposition Results for Pebble Macro Tree Transducers. J. Autom. Lang. Comb. 13(1): 3-44 (2008) - 2005
- [j40]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) - [j39]Zoltán Fülöp, Armin Kühnemann, Heiko Vogler:
Linear deterministic multi bottom-up tree transducers. Theor. Comput. Sci. 347(1-2): 276-287 (2005) - 2004
- [j38]Zoltán Fülöp, Armin Kühnemann, Heiko Vogler:
A bottom-up characterization of deterministic top-down tree transducers with regular look-ahead. Inf. Process. Lett. 91(2): 57-67 (2004) - [j37]Zoltán Fülöp, Heiko Vogler:
Weighted Tree Transducers. J. Autom. Lang. Comb. 9(1): 31-54 (2004) - [j36]Zoltán Fülöp, Zsolt Gazdag, Heiko Vogler:
Hierarchies of tree series transformations. Theor. Comput. Sci. 314(3): 387-429 (2004) - [j35]Zoltán Ésik, Zoltán Fülöp:
Foreword. Theor. Comput. Sci. 327(3): 223-224 (2004) - 2003
- [j34]Zoltán Fülöp, Heiko Vogler:
Tree Series Transformations that Respect Copying. Theory Comput. Syst. 36(3): 247-293 (2003) - [j33]Zoltán Fülöp, Zsolt Gazdag:
Shape preserving top-down tree transducers. Theor. Comput. Sci. 304(1-3): 315-339 (2003) - [e2]Zoltán Ésik, Zoltán Fülöp:
Developments in Language Theory, 7th International Conference, DLT 2003, Szeged, Hungary, July 7-11, 2003, Proceedings. Lecture Notes in Computer Science 2710, Springer 2003, ISBN 3-540-40434-1 [contents] - 2002
- [j32]Joost Engelfriet, Zoltán Fülöp, Heiko Vogler:
Bottom-Up and Top-Down Tree Series Transformations. J. Autom. Lang. Comb. 7(1): 11-70 (2002) - [j31]Zoltán Fülöp, Alain Terlutte:
Iterated relabeling tree transducers. Theor. Comput. Sci. 276(1-2): 221-244 (2002) - 2001
- [j30]Zoltán Fülöp:
Characterizing Important Subclasses of Attributed Tree Transformations by Macro Tree Transducers. J. Autom. Lang. Comb. 6(2): 145-189 (2001) - [j29]Zoltán Fülöp, Sándor Vágvölgyi:
Restricted ground tree transducers. Theor. Comput. Sci. 250(1-2): 219-233 (2001) - [j28]G. Dányi, Zoltán Fülöp:
The component hierarchy of chain-free cooperating distributed regular tree grammars. Theor. Comput. Sci. 262(1): 229-240 (2001) - 2000
- [j27]Zoltán Fülöp, Sebastian Maneth:
Domains of partial attributed tree transducers. Inf. Process. Lett. 73(5-6): 175-180 (2000)
1990 – 1999
- 1999
- [j26]Zoltán Fülöp, Eija Jurvanen, Magnus Steinby, Sándor Vágvölgyi:
On One-Pass Term Rewriting. Acta Cybern. 14(1): 83-98 (1999) - [j25]Tibor Csendes, Zoltán Fülöp:
Preface - Papers from the Conference for PhD Students in Computer Science. Acta Cybern. 14(2): 215-216 (1999) - [j24]Zoltán Fülöp:
Distributed Tree Processing Devices. Comput. Artif. Intell. 18(1): 37-71 (1999) - [j23]Zoltán Fülöp, Heiko Vogler:
A Characterization of Attributed Tree Transformations by a Subclass of Macro Tree Transducers. Theory Comput. Syst. 32(6): 649-676 (1999) - [c4]Zoltán Fülöp, Sebastian Maneth:
A Characterization of ETOL Tree Languages by Cooperating Regular Tree Grammars. Grammatical Models of Multi-Agent Systems 1999: 182-192 - 1998
- [b1]Zoltán Fülöp, Heiko Vogler:
Syntax-Directed Semantics - Formal Models Based on Tree Transducers. Monographs in Theoretical Computer Science. An EATCS Series, Springer 1998, ISBN 978-3-642-72250-9, pp. I-X, 1-273 - [j22]G. Dányi, Zoltán Fülöp:
Compositions with Superlinear Deterministic Top-Down Tree Transformations. Theor. Comput. Sci. 194(1-2): 57-85 (1998) - [c3]Zoltán Fülöp, Eija Jurvanen, Magnus Steinby, Sándor Vágvölgyi:
On One-Pass Term Rewriting. MFCS 1998: 248-256 - 1997
- [j21]Zoltán Fülöp, Sándor Vágvölgyi:
Minimal Equational Representations of Recognizable Tree Languages. Acta Informatica 34(1): 59-84 (1997) - 1996
- [j20]G. Dányi, Zoltán Fülöp:
A Note on the Equivalence Problem of E-Patterns. Inf. Process. Lett. 57(3): 125-128 (1996) - [j19]G. Dányi, Zoltán Fülöp:
Superlinear Deterministic Top-Down Tree Transducers. Math. Syst. Theory 29(5): 507-534 (1996) - 1995
- [j18]Zoltán Fülöp, Sándor Vágvölgyi:
Attributed Tree Transducers Cannot Induce all Deterministic Bottom-Up Tree Transformations. Inf. Comput. 116(2): 231-240 (1995) - [e1]Zoltán Fülöp, Ferenc Gécseg:
Automata, Languages and Programming, 22nd International Colloquium, ICALP95, Szeged, Hungary, July 10-14, 1995, Proceedings. Lecture Notes in Computer Science 944, Springer 1995, ISBN 3-540-60084-1 [contents] - 1994
- [j17]Zoltán Fülöp:
Undecidable Properties of Deterministic Top-Down Tree Transducers. Theor. Comput. Sci. 134(2): 311-328 (1994) - 1993
- [j16]Zoltán Fülöp, Pál Gyenizse:
On Injectivity of Deterministic Top-Down Tree Transducers. Inf. Process. Lett. 48(4): 183-188 (1993) - [j15]Zoltán Fülöp, Frank Herrmann, Sándor Vágvölgyi, Heiko Vogler:
Tree Transducers with External Functions. Theor. Comput. Sci. 108(2): 185-236 (1993) - 1992
- [p1]Zoltán Fülöp, Sándor Vágvölgyi:
Decidability of the inclusion in monoids generated by tree transformation classes. Tree Automata and Languages 1992: 381-408 - 1991
- [j14]Zoltán Fülöp, Sándor Vágvölgyi:
Ground Term Rewriting Rules for the Word Problem of Ground Term Equations. Bull. EATCS 45: 186-201 (1991) - [j13]Zoltán Fülöp, Sándor Vágvölgyi:
A Complete Classification of Deterministic Root-To-Frontier Tree Transformation Classes. Theor. Comput. Sci. 81(1): 1-15 (1991) - [j12]Zoltán Fülöp:
A Complete Description for a Monoid of Deterministic Bottom-Up Tree Transformation Classes. Theor. Comput. Sci. 88(2): 253-268 (1991) - 1990
- [j11]Zoltán Fülöp, Sándor Vágvölgyi:
A Complete Rewriting System for a Monoid of Tree Transformation Classes. Inf. Comput. 86(2): 195-212 (1990) - [j10]Zoltán Fülöp, Sándor Vágvölgyi:
The Emptiness Problem is Undecidable for Domains of Partial Monadic 2-Modular Tree Transformations. Inf. Process. Lett. 36(6): 293-296 (1990)
1980 – 1989
- 1989
- [j9]Zoltán Fülöp, Sándor Vágvölgyi:
Congruential tree languages are the same as recognizable tree languages - a proof for a theorem of D. Kozen. Bull. EATCS 39: 175-184 (1989) - [j8]Zoltán Fülöp, Sándor Vágvölgyi:
Top-Down Tree Transducers with Deterministic Top-Down Look-Ahead. Inf. Process. Lett. 33(1): 3-5 (1989) - [j7]Zoltán Fülöp, Sándor Vágvölgyi:
Variants of Top-Down Tree Transducers With Look-Ahead. Math. Syst. Theory 21(3): 125-145 (1989) - [c2]Zoltán Fülöp, Sándor Vágvölgyi:
Iterated Deterministic Top-Down Look-Ahead. FCT 1989: 175-184 - 1988
- [j6]Sándor Vágvölgyi, Zoltán Fülöp:
On ranges of compositions of deterministic root-to-frontier tree transformations. Acta Cybern. 8(3): 259-266 (1988) - [j5]Zoltán Fülöp, Sándor Vágvölgyi:
On domains of tree tranducers. Bull. EATCS 34: 55-61 (1988) - [c1]Zoltán Fülöp, Sándor Vágvölgyi:
A Characterization of Irreducible Sets Modulo Left-Linear Term Rewriting Systems by Tree Automata. ALP 1988: 157 - 1987
- [j4]Zoltán Fülöp, Sándor Vágvölgyi:
Results on compositions of deterministic root-to-frontier tree transformations. Acta Cybern. 8(1): 49-61 (1987) - [j3]Sándor Vágvölgyi, Zoltán Fülöp:
An infinite hierarchy of tree transformations in the class NDR. Acta Cybern. 8(2): 153-168 (1987) - 1983
- [j2]Zoltán Fülöp:
Decomposition results concerning K-visit attributed tree transducers. Acta Cybern. 6(2): 163-171 (1983) - 1981
- [j1]Zoltán Fülöp:
On attributed tree transducers. Acta Cybern. 5(3): 261-279 (1981)
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-08-17 23:41 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:
