EDBT 2026 Demo / reviewers in the wild / expert
Zoltán Fülöp 0001
dblp:f/ZoltanFulop1
· DBLP profile ↗
47ranked-venue papers
35as first author
3since 2021 · last 2024
0000-0002-3825-022XORCID · verified
Domains — the database's venue-derived domains; a paper can count in several
Theory of computation · 46 · 34 first-author · 3 since 2021Databases, data management, data science and information retrieval · 6 · 5 first-authorArtificial intelligence and machine learning · 1 · 1 first-author
| Year | Publication | Venue | Position |
|---|---|---|---|
| 2024 | Rational weighted tree languages with storage
Frederic Dörband, Zoltán Fülöp 0001, Heiko Vogler |
Inf. Comput. | 2 |
| 2022 | Principal abstract families of weighted tree languages
Zoltán Fülöp 0001, Heiko Vogler |
Inf. Comput. | 1 |
| 2022 | Finite-image property of weighted tree automata over past-finite monotonic strong bimonoids
Manfred Droste, Zoltán Fülöp 0001, Dávid Kószó, Heiko Vogler |
Theor. Comput. Sci. | 2 |
| 2019 | Composition Closure of Linear Weighted Extended Top-Down Tree Transducers
Zoltán Fülöp 0001, Andreas Maletti |
CIAA | 1 |
| 2019 | Weighted iterated linear control
Zoltán Fülöp 0001, Heiko Vogler |
Acta Informatica | 1 |
| 2019 | A Kleene theorem for weighted tree automata over tree valuation monoids
Doreen Götze, Zoltán Fülöp 0001, Manfred Droste |
Inf. Comput. | 2 |
| 2018 | Characterizations of recognizable weighted tree languages by logic and bimorphisms
Zoltán Fülöp 0001, Heiko Vogler |
Soft Comput. | 1 |
| 2017 | Composition Closure of Linear Extended Top-down Tree Transducers
Joost Engelfriet, Zoltán Fülöp 0001, Andreas Maletti |
Theory Comput. Syst. | 2 |
| 2016 | A Kleene Theorem for Weighted Tree Automata over Tree Valuation Monoids
Manfred Droste, Zoltán Fülöp 0001, Doreen Götze |
LATA | 2 |
| 2016 | Linking theorems for tree transducers
Zoltán Fülöp 0001, Andreas Maletti |
J. Comput. Syst. Sci. | 1 |
| 2015 | Characterizing weighted MSO for trees by branching transitive closure logics
Zoltán Fülöp 0001, Heiko Vogler |
Theor. Comput. Sci. | 1 |
| 2014 | Forward and backward application of symbolic tree transducers
Zoltán Fülöp 0001, Heiko Vogler |
Acta Informatica | 1 |
| 2013 | Composition Closure of ε-Free Linear Extended Top-Down Tree Transducers
Zoltán Fülöp 0001, Andreas Maletti |
Developments in Language Theory | 1 |
| 2012 | Equational weighted tree transformations
Symeon Bozapalidis, Zoltán Fülöp 0001, George Rahonis |
Acta Informatica | 2 |
| 2012 | A Büchi-Like Theorem for Weighted Tree Automata over Multioperator Monoids
Zoltán Fülöp 0001, Torsten Stüber, Heiko Vogler |
Theory Comput. Syst. | 1 |
| 2011 | Weighted Extended Tree TransducersabstractWeighted extended tree transducers (wxtts) over countably complete semirings are systematically explored. It is proved that the extension in the left-hand sides of a wxtt can be simulated by the inverse of a linear and nondeleting tree homomorphism. In addition, a characterization of the class of weighted tree transformations computable by bottom-up wxtts in terms of bimorphisms is provided. Backward and forward application to recognizable weighted tree languages are standard operations for wxtts. It is shown that the backward application of a linear wxtt preserves recognizability and that the domain of an arbitrary bottom-up wxtt is recognizable. Examples demonstrate that neither backward nor forward application of arbitrary wxtts preserves recognizability. Finally, a HASSE diagram relates most of the important subclasses of weighted tree transformations computable by wxtts. Zoltán Fülöp 0001, Andreas Maletti, Heiko Vogler |
Fundam. Informaticae | 1 |
| 2011 | Equational tree transformations
Symeon Bozapalidis, Zoltán Fülöp 0001, George Rahonis |
Theor. Comput. Sci. | 2 |
| 2011 | Varieties of recognizable tree series over fields
Zoltán Fülöp 0001, Magnus Steinby |
Theor. Comput. Sci. | 1 |
| 2009 | A Kleene Theorem for Weighted Tree Automata over Distributive Multioperator Monoids
Zoltán Fülöp 0001, Andreas Maletti, Heiko Vogler |
Theory Comput. Syst. | 1 |
| 2008 | Pebble Macro Tree Transducers with Strong Pebble Handling
Zoltán Fülöp 0001, Lorand Muzamel |
Fundam. Informaticae | 1 |
| 2005 | Linear deterministic multi bottom-up tree transducers
Zoltán Fülöp 0001, Armin Kühnemann, Heiko Vogler |
Theor. Comput. Sci. | 1 |
| 2004 | A bottom-up characterization of deterministic top-down tree transducers with regular look-ahead
Zoltán Fülöp 0001, Armin Kühnemann, Heiko Vogler |
Inf. Process. Lett. | 1 |
| 2004 | Foreword
Zoltán Ésik, Zoltán Fülöp 0001 |
Theor. Comput. Sci. | 2 |
| 2004 | Hierarchies of tree series transformations
Zoltán Fülöp 0001, Zsolt Gazdag, Heiko Vogler |
Theor. Comput. Sci. | 1 |
| 2003 | Tree Series Transformations that Respect Copying
Zoltán Fülöp 0001, Heiko Vogler |
Theory Comput. Syst. | 1 |
| 2003 | Shape preserving top-down tree transducers
Zoltán Fülöp 0001, Zsolt Gazdag |
Theor. Comput. Sci. | 1 |
| 2002 | Iterated relabeling tree transducers
Zoltán Fülöp 0001, Alain Terlutte |
Theor. Comput. Sci. | 1 |
| 2001 | The component hierarchy of chain-free cooperating distributed regular tree grammars
G. Dányi, Zoltán Fülöp 0001 |
Theor. Comput. Sci. | 2 |
| 2001 | Restricted ground tree transducers
Zoltán Fülöp 0001, Sándor Vágvölgyi |
Theor. Comput. Sci. | 1 |
| 2000 | Domains of partial attributed tree transducers
Zoltán Fülöp 0001, Sebastian Maneth |
Inf. Process. Lett. | 1 |
| 1999 | A Characterization of Attributed Tree Transformations by a Subclass of Macro Tree Transducers
Zoltán Fülöp 0001, Heiko Vogler |
Theory Comput. Syst. | 1 |
| 1998 | On One-Pass Term Rewriting
Zoltán Fülöp 0001, Eija Jurvanen, Magnus Steinby, Sándor Vágvölgyi |
MFCS | 1 |
| 1998 | Compositions with Superlinear Deterministic Top-Down Tree Transformations
G. Dányi, Zoltán Fülöp 0001 |
Theor. Comput. Sci. | 2 |
| 1997 | Minimal Equational Representations of Recognizable Tree Languages
Zoltán Fülöp 0001, Sándor Vágvölgyi |
Acta Informatica | 1 |
| 1996 | A Note on the Equivalence Problem of E-Patterns
G. Dányi, Zoltán Fülöp 0001 |
Inf. Process. Lett. | 2 |
| 1996 | Superlinear Deterministic Top-Down Tree Transducers
G. Dányi, Zoltán Fülöp 0001 |
Math. Syst. Theory | 2 |
| 1995 | Attributed Tree Transducers Cannot Induce all Deterministic Bottom-Up Tree Transformations
Zoltán Fülöp 0001, Sándor Vágvölgyi |
Inf. Comput. | 1 |
| 1994 | Undecidable Properties of Deterministic Top-Down Tree Transducers
Zoltán Fülöp 0001 |
Theor. Comput. Sci. | 1 |
| 1993 | On Injectivity of Deterministic Top-Down Tree Transducers
Zoltán Fülöp 0001, Pál Gyenizse |
Inf. Process. Lett. | 1 |
| 1993 | Tree Transducers with External Functions
Zoltán Fülöp 0001, Frank Herrmann, Sándor Vágvölgyi, Heiko Vogler |
Theor. Comput. Sci. | 1 |
| 1991 | A Complete Description for a Monoid of Deterministic Bottom-Up Tree Transformation Classes
Zoltán Fülöp 0001 |
Theor. Comput. Sci. | 1 |
| 1991 | A Complete Classification of Deterministic Root-To-Frontier Tree Transformation Classes
Zoltán Fülöp 0001, Sándor Vágvölgyi |
Theor. Comput. Sci. | 1 |
| 1990 | A Complete Rewriting System for a Monoid of Tree Transformation Classes
Zoltán Fülöp 0001, Sándor Vágvölgyi |
Inf. Comput. | 1 |
| 1990 | The Emptiness Problem is Undecidable for Domains of Partial Monadic 2-Modular Tree Transformations
Zoltán Fülöp 0001, Sándor Vágvölgyi |
Inf. Process. Lett. | 1 |
| 1989 | Iterated Deterministic Top-Down Look-Ahead
Zoltán Fülöp 0001, Sándor Vágvölgyi |
FCT | 1 |
| 1989 | Top-Down Tree Transducers with Deterministic Top-Down Look-Ahead
Zoltán Fülöp 0001, Sándor Vágvölgyi |
Inf. Process. Lett. | 1 |
| 1989 | Variants of Top-Down Tree Transducers With Look-Ahead
Zoltán Fülöp 0001, Sándor Vágvölgyi |
Math. Syst. Theory | 1 |