Homepage of Zoltán Fülöp

List of Publications

Books

  • Formal Languages and Syntactic Parsing, (in Hungarian), Polygon, Szeged, 1999, 2nd edition 2004.
  • Syntax-Directed Semantics - Formal Models based on Tree Transducers (with H. Vogler), Monographs in Theoretical Computer Science, An EATCS Series, Springer Publishing Company, 1998. A corrigenda

Edited volumes

  • Automata, Formal Languages and Related Topics, Dedicated to Ferenc Gécseg on the occasion of his 70th birthday (coeditor with Z. Ésik), Novadat, 2009.
  • Proceedings of the 4th Conference for PhD Students (CSCS 04), Special issue of Acta Cybernetica Vol. 17, No. 2, 2005.
  • Proceedings of AFL 05, the 11th International Conference on Automata and Formal Languages, (coeditor with Z. Ésik), Novadat, 2005.
  • Developments in Language Theory, DLT 03, (coeditor with Z. Ésik), Special issue of Theoretical Computer Science, Vol. 327, No. 3, 2004.
  • Proceedings of DLT 03 (coeditor with Z. Ésik), Lecture Notes in Computer Science 2710, Springer-Verlag, 2003.
  • Proceedings of the 3rd Conference for PhD Students (CSCS 02), Special issue of Acta Cybernetica Vol. 16, No. 2, 2003.
  • Proceedings of the Seventh Finno-Ugoric Symposium on Programming Languages and Software Tools (SPLST 01) (coeditor with T. Gyimóthy) Special issue of Acta Cybernetica Vol. 15, No. 4, 2002.
  • Proceedings of the 2nd Conference for PhD Students (CSCS 2000), Special issue of Acta Cybernetica Vol. 15, No. 2, 2001.
  • Proceedings of the 1st Conference for PhD Students (CSCS 98), Special issue of Acta Cybernetica Vol. 14, No. 2, 1999.
  • Proceedings of ICALP 95 (coeditor with F. Gécseg), Lecture Notes in Computer Science 944, Springer-Verlag, 1995.

Papers

  • Minimization of Deterministic Top-down Tree Automata (with S. Vágvölgyi), Acta Cybernetica 23 (2017) 379-401.
  • Composition Closure of Linear Extended Top-down Tree Transducers (with J. Engelfriet and A. Maletti), Theory of Computing Systems, 60 (2017) 129-171.
  • Linking theorems for tree transducers (with A. Maletti), Journal of Computer and System Sciences 82 (2016) 1201-1222.
  • A Kleene Theorem for Weighted Tree Automata over Tree Valuation Monoids (with M. Droste and D. Götze), In: Proc. of LATA 2016 (Eds. A.-H. Dediu, J. Janousek, C.-M. Vide, and B. Truthe), Lecture Notes in Computer Science, Vol. 9618, Springer-Verlag, 2016, 452-463.
  • Characterizations of Recognizable Weighted Tree Languages by Logic and Bimorphisms (with H. Vogler), Soft Computing (2015) DOI: 10.1007/s00500-015-1717-2
  • Local Weighted Tree Languages, Acta Cybernetica 22 (2015) 393-402.
  • Characterizing Weighted MSO for Trees by Branching Transitive Closure Logics (with H. Vogler), Theoretical Computer Science 594 (2015) 82-105.
  • Forward and Backward Application of Symbolic Tree Transducers (with H. Vogler), Acta Informatica 51 (2014) 297-325.
  • Composition Closure of epsilon-free Linear Extended Top-down Tree Transducers (with A. Maletti), In: Proc. of DLT 2013 (Eds. M. P. Béal and O. Carton), Lecture Notes in Computer Science, Vol. 7907, Springer-Verlag, 2013, 239-251.
  • Equational Weighted Tree Transformations (with S. Bozapalidis and G. Rahonis), Acta Informatica 49 (2012) 29-52.
  • A Büchi-like Theorem for Weighted Tree Automata over Multioperator Monoids (with T. Stüber and H. Vogler), Theory of Computing Systems 50 (2012) 241-278.
  • Weighted Extended Tree Transducers (with A. Maletti and H. Vogler), Fundamenta Informaticae 111 (2011) 163-202.
  • Equational Weighted Tree Transformations with Discounting (with G. Rahonis), In: Algebraic Foundations in Computer Science (Eds. W. Kuich and G. Rahonis), Lecture Notes in Computer Science, Vol. 7020, Springer-Verlag, 2011, 112-145.
  • Equational Tree Transformations (with S. Bozapalidis and G. Rahonis), Theoret. Comput. Science 412 (2011) 3676-3692.
  • Varieties of Recognizable Tree Series over Fields (with M. Steinby), Theoret. Comput. Science 412 (2011) 736-752.
  • Preservation of Recognizability for Synchronous Tree Substitution Grammars (with A. Maletti and H. Vogler), In: Proceedings of the 2010 Workshop on Applications of Tree Automata in Natural Language Processing (F. Drewes and M. Kuhlmann eds.) The Association for Computational Linguistics, 2010, 1-9.
  • Weighted Tree-Walking Automata (with L. Muzamel). Acta Cybernetica 19 (2009) 275-293.
  • Weighted Tree Automata and Tree Transducers (with H. Vogler). In: M. Droste, W. Kuich, and H. Vogler, editors, Handbook of Weighted Automata, Chap. 9, Springer, Berlin, 2009.
  • Decomposition of Weighted Multioperator Tree Automata (with T. Stüber and H. Vogler), Int. J. Found. Comput. Sci., 20 (2009) 221-245.
  • Formal Series of General Algebras over a Field and Their Syntactic Algebras (with M. Steinby), In: Automata, Formal Languages, and Related Topics (Z. Ésik and Z. Fülöp eds.) Novadat, 2009, 55-78. Authorcopy.
  • A Kleene Theorem for Weighted Tree Automata over Distributive Multioperator Monoids (with A. Maletti and H. Vogler), Theory of Computing Systems, 44 (2009) 455-499.
  • Pebble Macro Tree Transducers with Strong Pebble Handling (with L. Muzamel), Fundamenta Informaticae, 89 (2008) 207-257.
  • Circularity, Composition, and Decomposition Results for Pebble Macro Tree Transducers (with L. Muzamel), Journal of Automata, Langauges and Combinatorics, 13 (2008) 3-44.
  • Compact Representation of Hungarian Corpora (with A. Kertész-Farkas and A. Kocsor) (in Hungarian), Alkalmazott Nyelvtudomány 1-2 (2005) 61-70.
  • An Introduction to Tree Transducers, Formal Methods in Computing (Eds. M. Ferenczi, A. Pataricza and L. Rónyai), Akadémiai Kiadó, Budapest, 2005, 199-258.
  • Recent Results on Pebble Macro Tree Transducers (with L. Muzamel), In. Proc. of the 1st International Conference on Algebraic Informatics (October 20 - 23 2005, Thessaloniki), 281-284.
  • Linear Deterministic Multi Bottom-up Tree Transducers, (with A. Küehnemann and H. Vogler), Theoret. Comput. Science, 347 (2005) 275-287.
  • Bounds for Tree Automata with Polynomial Costs (with B. Borchardt, Zs. Gazdag and A. Maletti), Journal of Automata, Langauges and Combinatorics, 10 (2005) 107-157.
  • A bottom-up characterization of deterministic top-down tree transducers with regular look-ahead (with A. Küehnemann and H. Vogler), Inf. Process. Letters, 91 (2004) 57-67.
  • Weighted Tree Transducers (with H. Vogler), Journal of Automata, Langauges and Combinatorics, 9 (2004) 31-54.
  • Hiererchies of Tree Series Transformations (with Zs. Gazdag and H. Vogler), Theoret. Comput. Science, 314 (2004) 387-429.
  • Tree Tranducers with Costs (with H. Vogler), In. Proc. of the 10th International Conference on Automata and Formal Languages (August 13 - 18, 2002, Debrecen, Hungary).
  • Tree Series Transformations that Respect Copying (with H. Vogler), Theory of Computing Systems, 36 (2003) 247-293.
  • Shape Preserving Top-Down Tree Transducers (with Zs. Gazdag), Theoret. Comput. Science, 304 (2003) 315-339.
  • Bottom-up and Top-down Tree Series Transformations (with J. Engelfriet and H. Vogler), Journal of Automata, Langauges and Combinatorics, 7 (2002) 11-70.
  • Iterated Relabeling Tree Transducers (with A. Terlutte), Theoret. Comput. Science, 276 (2002) 221-244.
  • Branching-Pattern Analysis of the Dendritic Arborization in the Thalamic Nuclei of the Rat Brain (with Cs. Szigeti and K. Gulya), Acta Biologica Hungarica, 53 (2002) 177-186.
  • The Component Hierarchy of Chain-Free Cooperating Distributed Regular Tree Grammar Systems (with G. Dányi), Theoret. Comput. Science, 262 (2001) 229-240.
  • Characterizing Importan Subclasses of Attributed Tree Transformations by Macro Tree Transducers, Journal of Automata, Langauges and Combinatorics 6 (2001) 145-189.
  • Restricted Ground Tree Transducers (with S. Vágvölgyi), Theoret. Comput. Science, 250 (2001) 219-233.
  • Domains of Partial Attributed Tree Transducers (with S. Maneth), Inf. Process. Letters, 73 (2000) 175-180.
  • A Characterization of Attributed Tree Transformations by a Subclass of Macro Tree Transducers (with H. Vogler), Theory of Computing Systems, 32 (1999) 649-676.
  • Distributed Tree Precessing Devices, Computers and Artificial Intelligence, 18 (1999) 37-71.
  • On One-Pass Term Rewriting (with E. Jurvanen, M. Steinby and S. Vágvölgyi), Proc. of MFCS 98, Lecture Notes in Computer Science (Eds. L. Brim, J. Gruska, és J. Zlatusak), Vol. 1450, 248-256. Folyóirat verzió: Acta Cybernetica 14 (1999) 83-98.
  • A Characterization of ETOL Tree Languages by Cooperating Regular Tree Grammars (with S. Maneth), Grammatical Models of Multi-Agent Systems (Eds. G. Paun és A. Salomaa), Gordon and Breach, 1998, 182-192.
  • Compositions with Superlinear Deterministic Top-Down Tree Transformations (with G. Dányi), Theoret. Comput. Science 194 (1998) 57-85.
  • Minimal Equational Representations of Recognizable Tree Languages (with S. Vágvölgyi), Acta Informatica 34 (1997) 59-84.
  • Super-Linear Deterministic Top-Down Tree Transducers (with G. Dányi), Math. Systems Theory, 29 (1996) 507-534.
  • A note on the equivalence problem of E-patterns (with G. Dányi), Inf. Process. Letters 57 (1996) 125-128.
  • Attributed tree transducers cannot induce all deterministic bottom-up tree transformations (with S. Vágvölgyi), Information and Computation 116 (1995) 231-240.
  • Undecidable properties of deterministic top-down tree transducers, Theoret. Comput. Science, 134 (1994) 311-328.
  • On injectivity of deterministic top-down tree transducers (with P. Gyenizse), Inform. Process. Lett. 48 (1993) 183-188.
  • Tree Transducers with External Functions (with F. Hermann, S. Vágvölgyi and H. Vogler), Theoret. Comput. Science 108 (1993) 185-236.
  • Decidability of the inclusion in monoids generated by tree transformation classes (with S. Vágvölgyi), Tree Automata and Tree Languages (Eds. M. Nivat és A. Podelski), Elsevier Science Publishers, 1992, 381-408.
  • Ground term rewriting rules for the word problem of ground term equations (with S. Vágvölgyi), Bulletin of the EATCS 45 (1991) 186-201.
  • A complete description for a monoid of deterministic bottom-up tree transformation classes, Theoret. Comput. Science 88 (1991) 253-268.
  • A complete classification of deterministic root-to-frontier tree transformation classes (with S. Vágvölgyi), Theoret. Comput. Science 81 (1991) 1-15.
  • Decidability Questions in Monoids Generated by Tree Transformation Classes (in Hungarian), Alkalmazott Matematikai Lapok 15 (1990-91) 219-266.
  • The emptiness problem is undecidable for domains of partial monadic 2-modular tree transformations (with S. Vágvölgyi), Inform. Process. Lett. 36 (1990) 293-296.
  • A characterization of irreducible sets modulo left linear term rewriting systems by tree automata (with S. Vágvölgyi), Fundamenta Informaticae 13 (1990) 211-226.
  • A Complete Rewriting System for a Monoid of Tree Transformation Classes (with S. Vágvölgyi), Information and Computation 86 (1990) 195-212.
  • Top-down tree transducers with deterministic top-down look-ahead (with S. Vágvölgyi), Inform. Process. Lett. 33 (1989/90) 3-5.
  • Variants of Top-Down Tree Transducers with Look-Ahead (with S. Vágvölgyi), Math. Systems Theory 21 (1989) 125-145.
  • Congruential tree languages are the same as recognizable tree languages (with S. Vágvölgyi), Bulletin of the EATCS 39 (1989) 175-185.
  • Iterated deterministic top-down look-ahead (with S. Vágvölgyi) Proc. FCT'89, Lecture Notes in Computer Science (Eds. Csirik J., Demetrovics J. és Gécseg F.), Vol. 380, 175-184.
  • A finite presentation for a monoid of tree transformation classes (with S. Vágvölgyi), Proc. 2nd Conference on Automata, Languages and Programming Systems (Eds. Gécseg F. és Peák I.), Dept. of Mathematics, University of Economics, Budapest (1988), 115-124.
  • On domains of 2-modular tree transducers (with S. Vágvölgyi), Proc. 2nd Conference on Automata, Languages and Programming Systems (Eds. Gécseg F. és Peák I.), Dept. of Mathematics, University of Economics, Budapest (1988), 125-139.
  • On domains of tree transducers (with S. Vágvölgyi), Bulletin of the EATCS , 34 (1988) 55-61.
  • On ranges of compositions of deterministic root-to-frontier tree transformations (with S. Vágvölgyi), Acta Cybernet. 8 (1988) 259-266.
  • An infinite hierarchy of tree transformations in the class NDR (with S. Vágvölgyi), Acta Cybernet. 8 (1987) 153-168.
  • Results on compositions of deterministic root-to-frontier tree transformations (with S. Vágvölgyi), Acta Cybernet. 8 (1987) 49-61.
  • Decomposition results concerning K-visit attributed tree transducers, Acta Cybernet. 6 (1983) 163-171.
  • On attributed tree transducers, Acta Cybernet. 5 (1981) 261-279.

Theses (in Hungarian language)

  • A Comparison of the Computational Power of Tree Transducers, Thesis for the title Doctor of Academy (DSC), HAS, 2003.
  • Decidability Questions in Monoids Generated by Tree Transformation Classes, Thesis for the degree Candidate in Computer Science (CSC), HAS, 1990.
  • Attributed Tree Transducers, Thesis for the degree Doctor of University, József Attila University, Szeged, 1981.
  • A Solution for the Equivalence Problem of Deterministic GSM's., MSc thesis, József Attila University, Szeged, 1979.

Last updated

15/04/2014