| 2009 |
|---|
| 50 | EE | 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) |
| 2008 |
|---|
| 49 | EE | Zoltán Fülöp,
Lorand Muzamel:
Pebble Macro Tree Transducers with Strong Pebble Handling.
Fundam. Inform. 89(2-3): 207-257 (2008) |
| 48 | | Zoltán Fülöp,
Lorand Muzamel:
Circularity, Composition, and Decomposition Results for Pebble Macro Tree Transducers.
Journal of Automata, Languages and Combinatorics 13(1): 3-44 (2008) |
| 2005 |
|---|
| 47 | | Björn Borchardt,
Zoltán Fülöp,
Zsolt Gazdag,
Andreas Maletti:
Bounds for Tree Automata with Polynomial Costs.
Journal of Automata, Languages and Combinatorics 10(2/3): 107-157 (2005) |
| 46 | EE | 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 |
|---|
| 45 | EE | 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) |
| 44 | | Zoltán Fülöp,
Heiko Vogler:
Weighted Tree Transducers.
Journal of Automata, Languages and Combinatorics 9(1): 31-54 (2004) |
| 43 | EE | Zoltán Fülöp,
Zsolt Gazdag,
Heiko Vogler:
Hierarchies of tree series transformations.
Theor. Comput. Sci. 314(3): 387-429 (2004) |
| 42 | EE | Zoltán Ésik,
Zoltán Fülöp:
Foreword.
Theor. Comput. Sci. 327(3): 223-224 (2004) |
| 2003 |
|---|
| 41 | | Zoltán Ésik,
Zoltán Fülöp:
Developments in Language Theory, 7th International Conference, DLT 2003, Szeged, Hungary, July 7-11, 2003, Proceedings
Springer 2003 |
| 40 | EE | Zoltán Fülöp,
Zsolt Gazdag:
Shape preserving top-down tree transducers.
Theor. Comput. Sci. 1-3(304): 315-339 (2003) |
| 39 | EE | Zoltán Fülöp,
Heiko Vogler:
Tree Series Transformations that Respect Copying.
Theory Comput. Syst. 36(3): 247-293 (2003) |
| 2002 |
|---|
| 38 | | Joost Engelfriet,
Zoltán Fülöp,
Heiko Vogler:
Bottom-Up and Top-Down Tree Series Transformations.
Journal of Automata, Languages and Combinatorics 7(1): 11-70 (2002) |
| 37 | EE | Zoltán Fülöp,
Alain Terlutte:
Iterated relabeling tree transducers.
Theor. Comput. Sci. 276(1-2): 221-244 (2002) |
| 2001 |
|---|
| 36 | | Zoltán Fülöp:
Characterizing Important Subclasses of Attributed Tree Transformations by Macro Tree Transducers.
Journal of Automata, Languages and Combinatorics 6(2): 145-190 (2001) |
| 35 | EE | Zoltán Fülöp,
Sándor Vágvölgyi:
Restricted ground tree transducers.
Theor. Comput. Sci. 250(1-2): 219-233 (2001) |
| 34 | EE | 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 |
|---|
| 33 | EE | Zoltán Fülöp,
Sebastian Maneth:
Domains of partial attributed tree transducers.
Inf. Process. Lett. 73(5-6): 175-180 (2000) |
| 1999 |
|---|
| 32 | | 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 |
| 31 | EE | 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) |
| 30 | EE | 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) |
| 29 | | Zoltán Fülöp:
Distributed Tree Processing Devices.
Computers and Artificial Intelligence 18(1): (1999) |
| 28 | EE | 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) |
| 1998 |
|---|
| 27 | EE | Zoltán Fülöp,
Eija Jurvanen,
Magnus Steinby,
Sándor Vágvölgyi:
On One-Pass Term Rewriting.
MFCS 1998: 248-256 |
| 26 | EE | 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) |
| 1997 |
|---|
| 25 | | Zoltán Fülöp,
Sándor Vágvölgyi:
Minimal Equational Representations of Recognizable Tree Languages.
Acta Inf. 34(1): 59-84 (1997) |
| 1996 |
|---|
| 24 | EE | 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) |
| 23 | | G. Dányi,
Zoltán Fülöp:
Superlinear Deterministic Top-Down Tree Transducers.
Mathematical Systems Theory 29(5): 507-534 (1996) |
| 1995 |
|---|
| 22 | | Zoltán Fülöp,
Ferenc Gécseg:
Automata, Languages and Programming, 22nd International Colloquium, ICALP95, Szeged, Hungary, July 10-14, 1995, Proceedings
Springer 1995 |
| 21 | | 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) |
| 1994 |
|---|
| 20 | | Zoltán Fülöp:
Undecidable Properties of Deterministic Top-Down Tree Transducers.
Theor. Comput. Sci. 134(2): 311-328 (1994) |
| 1993 |
|---|
| 19 | | Zoltán Fülöp,
Pál Gyenizse:
On Injectivity of Deterministic Top-Down Tree Transducers.
Inf. Process. Lett. 48(4): 183-188 (1993) |
| 18 | | 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 |
|---|
| 17 | | 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 |
|---|
| 16 | | Zoltán Fülöp,
Sándor Vágvölgyi:
Ground Term Rewriting Rules for the Word Problem of Ground Term Equations.
Bulletin of the EATCS 45: 186-201 (1991) |
| 15 | | 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) |
| 14 | | 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 |
|---|
| 13 | | 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) |
| 12 | | 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) |
| 1989 |
|---|
| 11 | | Zoltán Fülöp,
Sándor Vágvölgyi:
Iterated Deterministic Top-Down Look-Ahead.
FCT 1989: 175-184 |
| 10 | | 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.
Bulletin of the EATCS 39: 175-184 (1989) |
| 9 | | 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) |
| 8 | | Zoltán Fülöp,
Sándor Vágvölgyi:
Variants of Top-Down Tree Transducers With Look-Ahead.
Mathematical Systems Theory 21(3): 125-145 (1989) |
| 1988 |
|---|
| 7 | | 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 |
| 6 | | Sándor Vágvölgyi,
Zoltán Fülöp:
On ranges of compositions of deterministic root-to-frontier tree transformations.
Acta Cybern. 8: 259-266 (1988) |
| 5 | | Zoltán Fülöp,
Sándor Vágvölgyi:
On domains of tree tranducers.
Bulletin of the EATCS 34: 55-61 (1988) |
| 1987 |
|---|
| 4 | | Sándor Vágvölgyi,
Zoltán Fülöp:
An infinite hierarchy of tree transformations in the cals NDR.
Acta Cybern. 8: 153-168 (1987) |
| 3 | | Zoltán Fülöp,
Sándor Vágvölgyi:
Results on compositions of deterministic root-to-frontier tree transformations.
Acta Cybern. 8: 49-61 (1987) |
| 1983 |
|---|
| 2 | | Zoltán Fülöp:
Decomposition results concerning K-visit attributed tree transducers.
Acta Cybern. 6: 163-171 (1983) |
| 1981 |
|---|
| 1 | | Zoltán Fülöp:
On attributed tree transducers.
Acta Cybern. 5: 261-279 (1981) |
