other persons with the same name:
- CSB - MetaPress - Google - Bing - Yahoo
 | 2013 | |
|---|---|---|
| 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 Inf. 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. Inform. 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) |
| c6 | | Zoltán Fülöp, George Rahonis: Equational Weighted Tree Transformations with Discounting. Algebraic Foundations in Computer Science 2011: 112-145 |
| 2009 | ||
| j45 | | |
| 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 (Eds.): 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 |
| 2008 | ||
| j42 | | Zoltán Fülöp, Lorand Muzamel: Pebble Macro Tree Transducers with Strong Pebble Handling. Fundam. Inform. 89(2-3): 207-257 (2008) |
| j41 | | 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 | ||
| j40 | | 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) |
| 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. Journal of Automata, Languages and Combinatorics 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 | | |
| 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. 1-3(304): 315-339 (2003) |
| e2 | | Zoltán Ésik, Zoltán Fülöp (Eds.): 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 |
| 2002 | ||
| j32 | | 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) |
| 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. Journal of Automata, Languages and Combinatorics 6(2): 145-190 (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) |
| 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. Computers and Artificial Intelligence 18(1) (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 | ||
| 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 Inf. 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. Mathematical Systems 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 (Eds.): 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 |
| 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. Bulletin of the 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) |
| 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. Bulletin of the 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. Mathematical Systems Theory 21(3): 125-145 (1989) |
| c2 | | |
| 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: 259-266 (1988) |
| j5 | | Zoltán Fülöp, Sándor Vágvölgyi: On domains of tree tranducers. Bulletin of the 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: 49-61 (1987) |
| j3 | | 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) |
| 1983 | ||
| j2 | | Zoltán Fülöp: Decomposition results concerning K-visit attributed tree transducers. Acta Cybern. 6: 163-171 (1983) |
| 1981 | ||
| j1 | | |
Colors in the list of coauthors
Last update Wed May 22 23:53:04 2013 CET by the DBLP Team —
Data released under the ODC-BY 1.0 license — See also our legal information page