Search the dblp DataBase
Zoltán Fülöp :
[Publications ]
[Author Rank by year ]
[Co-authors ]
[Prefers ]
[Cites ]
[Cited by ]
Publications of Author
Zoltán Fülöp , Sándor Vágvölgyi A Characterization of Irreducible Sets Modulo Left-Linear Term Rewriting Systems by Tree Automata. [Citation Graph (0, 0)][DBLP ] ALP, 1988, pp:157- [Conf ] Zoltán Fülöp , Sándor Vágvölgyi Iterated Deterministic Top-Down Look-Ahead. [Citation Graph (0, 0)][DBLP ] FCT, 1989, pp:175-184 [Conf ] Zoltán Fülöp , Sebastian Maneth A Characterization of ETOL Tree Languages by Cooperating Regular Tree Grammars. [Citation Graph (0, 0)][DBLP ] Grammatical Models of Multi-Agent Systems, 1999, pp:182-192 [Conf ] Zoltán Fülöp , Eija Jurvanen , Magnus Steinby , Sándor Vágvölgyi On One-Pass Term Rewriting. [Citation Graph (0, 0)][DBLP ] MFCS, 1998, pp:248-256 [Conf ] Zoltán Fülöp , Sándor Vágvölgyi Minimal Equational Representations of Recognizable Tree Languages. [Citation Graph (0, 0)][DBLP ] Acta Inf., 1997, v:34, n:1, pp:59-84 [Journal ] Tibor Csendes , Zoltán Fülöp Preface - Papers from the Conference for PhD Students in Computer Science. [Citation Graph (0, 0)][DBLP ] Acta Cybern., 1999, v:14, n:2, pp:215-216 [Journal ] Zoltán Fülöp On attributed tree transducers. [Citation Graph (0, 0)][DBLP ] Acta Cybern., 1981, v:5, n:, pp:261-279 [Journal ] Zoltán Fülöp Decomposition results concerning K-visit attributed tree transducers. [Citation Graph (0, 0)][DBLP ] Acta Cybern., 1983, v:6, n:, pp:163-171 [Journal ] Zoltán Fülöp , Eija Jurvanen , Magnus Steinby , Sándor Vágvölgyi On One-Pass Term Rewriting. [Citation Graph (0, 0)][DBLP ] Acta Cybern., 1999, v:14, n:1, pp:83-98 [Journal ] Zoltán Fülöp , Sándor Vágvölgyi Results on compositions of deterministic root-to-frontier tree transformations. [Citation Graph (0, 0)][DBLP ] Acta Cybern., 1987, v:8, n:, pp:49-61 [Journal ] Sándor Vágvölgyi , Zoltán Fülöp An infinite hierarchy of tree transformations in the cals NDR. [Citation Graph (0, 0)][DBLP ] Acta Cybern., 1987, v:8, n:, pp:153-168 [Journal ] Sándor Vágvölgyi , Zoltán Fülöp On ranges of compositions of deterministic root-to-frontier tree transformations. [Citation Graph (0, 0)][DBLP ] Acta Cybern., 1988, v:8, n:, pp:259-266 [Journal ] Zoltán Fülöp Distributed Tree Processing Devices. [Citation Graph (0, 0)][DBLP ] Computers and Artificial Intelligence, 1999, v:18, n:1, pp:- [Journal ] Zoltán Fülöp , Sándor Vágvölgyi Ground Term Rewriting Rules for the Word Problem of Ground Term Equations. [Citation Graph (0, 0)][DBLP ] Bulletin of the EATCS, 1991, v:45, n:, pp:186-201 [Journal ] Zoltán Fülöp , Sándor Vágvölgyi On domains of tree tranducers. [Citation Graph (0, 0)][DBLP ] Bulletin of the EATCS, 1988, v:34, n:, pp:55-61 [Journal ] 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. [Citation Graph (0, 0)][DBLP ] Bulletin of the EATCS, 1989, v:39, n:, pp:175-184 [Journal ] Zoltán Fülöp , Sándor Vágvölgyi A Complete Rewriting System for a Monoid of Tree Transformation Classes [Citation Graph (0, 0)][DBLP ] Inf. Comput., 1990, v:86, n:2, pp:195-212 [Journal ] Zoltán Fülöp , Sándor Vágvölgyi Attributed Tree Transducers Cannot Induce all Deterministic Bottom-Up Tree Transformations [Citation Graph (0, 0)][DBLP ] Inf. Comput., 1995, v:116, n:2, pp:231-240 [Journal ] G. Dányi , Zoltán Fülöp A Note on the Equivalence Problem of E-Patterns. [Citation Graph (0, 0)][DBLP ] Inf. Process. Lett., 1996, v:57, n:3, pp:125-128 [Journal ] Zoltán Fülöp , Pál Gyenizse On Injectivity of Deterministic Top-Down Tree Transducers. [Citation Graph (0, 0)][DBLP ] Inf. Process. Lett., 1993, v:48, n:4, pp:183-188 [Journal ] Zoltán Fülöp , Armin Kühnemann , Heiko Vogler A bottom-up characterization of deterministic top-down tree transducers with regular look-ahead. [Citation Graph (0, 0)][DBLP ] Inf. Process. Lett., 2004, v:91, n:2, pp:57-67 [Journal ] Zoltán Fülöp , Sebastian Maneth Domains of partial attributed tree transducers. [Citation Graph (0, 0)][DBLP ] Inf. Process. Lett., 2000, v:73, n:5-6, pp:175-180 [Journal ] Zoltán Fülöp , Sándor Vágvölgyi Top-Down Tree Transducers with Deterministic Top-Down Look-Ahead. [Citation Graph (0, 0)][DBLP ] Inf. Process. Lett., 1989, v:33, n:1, pp:3-5 [Journal ] Zoltán Fülöp , Sándor Vágvölgyi The Emptiness Problem is Undecidable for Domains of Partial Monadic 2-Modular Tree Transformations. [Citation Graph (0, 0)][DBLP ] Inf. Process. Lett., 1990, v:36, n:6, pp:293-296 [Journal ] Zoltán Fülöp Characterizing Important Subclasses of Attributed Tree Transformations by Macro Tree Transducers. [Citation Graph (0, 0)][DBLP ] Journal of Automata, Languages and Combinatorics, 2001, v:6, n:2, pp:145-190 [Journal ] Zoltán Fülöp , Heiko Vogler Weighted Tree Transducers. [Citation Graph (0, 0)][DBLP ] Journal of Automata, Languages and Combinatorics, 2004, v:9, n:1, pp:31-54 [Journal ] Joost Engelfriet , Zoltán Fülöp , Heiko Vogler Bottom-Up and Top-Down Tree Series Transformations. [Citation Graph (0, 0)][DBLP ] Journal of Automata, Languages and Combinatorics, 2002, v:7, n:1, pp:11-70 [Journal ] G. Dányi , Zoltán Fülöp Superlinear Deterministic Top-Down Tree Transducers. [Citation Graph (0, 0)][DBLP ] Mathematical Systems Theory, 1996, v:29, n:5, pp:507-534 [Journal ] Zoltán Fülöp , Heiko Vogler Tree Series Transformations that Respect Copying. [Citation Graph (0, 0)][DBLP ] Theory Comput. Syst., 2003, v:36, n:3, pp:247-293 [Journal ] Zoltán Fülöp , Sándor Vágvölgyi Variants of Top-Down Tree Transducers With Look-Ahead. [Citation Graph (0, 0)][DBLP ] Mathematical Systems Theory, 1989, v:21, n:3, pp:125-145 [Journal ] Zoltán Fülöp , Heiko Vogler A Characterization of Attributed Tree Transformations by a Subclass of Macro Tree Transducers. [Citation Graph (0, 0)][DBLP ] Theory Comput. Syst., 1999, v:32, n:6, pp:649-676 [Journal ] G. Dányi , Zoltán Fülöp The component hierarchy of chain-free cooperating distributed regular tree grammars. [Citation Graph (0, 0)][DBLP ] Theor. Comput. Sci., 2001, v:262, n:1, pp:229-240 [Journal ] G. Dányi , Zoltán Fülöp Compositions with Superlinear Deterministic Top-Down Tree Transformations. [Citation Graph (0, 0)][DBLP ] Theor. Comput. Sci., 1998, v:194, n:1-2, pp:57-85 [Journal ] Zoltán Ésik , Zoltán Fülöp Foreword. [Citation Graph (0, 0)][DBLP ] Theor. Comput. Sci., 2004, v:327, n:3, pp:223-224 [Journal ] Zoltán Fülöp A Complete Description for a Monoid of Deterministic Bottom-Up Tree Transformation Classes. [Citation Graph (0, 0)][DBLP ] Theor. Comput. Sci., 1991, v:88, n:2, pp:253-268 [Journal ] Zoltán Fülöp Undecidable Properties of Deterministic Top-Down Tree Transducers. [Citation Graph (0, 0)][DBLP ] Theor. Comput. Sci., 1994, v:134, n:2, pp:311-328 [Journal ] Zoltán Fülöp , Zsolt Gazdag Shape preserving top-down tree transducers. [Citation Graph (0, 0)][DBLP ] Theor. Comput. Sci., 2003, v:1, n:304, pp:315-339 [Journal ] Zoltán Fülöp , Zsolt Gazdag , Heiko Vogler Hierarchies of tree series transformations. [Citation Graph (0, 0)][DBLP ] Theor. Comput. Sci., 2004, v:314, n:3, pp:387-429 [Journal ] Zoltán Fülöp , Frank Herrmann , Sándor Vágvölgyi , Heiko Vogler Tree Transducers with External Functions. [Citation Graph (0, 0)][DBLP ] Theor. Comput. Sci., 1993, v:108, n:2, pp:185-236 [Journal ] Zoltán Fülöp , Armin Kühnemann , Heiko Vogler Linear deterministic multi bottom-up tree transducers. [Citation Graph (0, 0)][DBLP ] Theor. Comput. Sci., 2005, v:347, n:1-2, pp:276-287 [Journal ] Zoltán Fülöp , Alain Terlutte Iterated relabeling tree transducers. [Citation Graph (0, 0)][DBLP ] Theor. Comput. Sci., 2002, v:276, n:1-2, pp:221-244 [Journal ] Zoltán Fülöp , Sándor Vágvölgyi Restricted ground tree transducers. [Citation Graph (0, 0)][DBLP ] Theor. Comput. Sci., 2001, v:250, n:1-2, pp:219-233 [Journal ] Zoltán Fülöp , Sándor Vágvölgyi A Complete Classification of Deterministic Root-To-Frontier Tree Transformation Classes. [Citation Graph (0, 0)][DBLP ] Theor. Comput. Sci., 1991, v:81, n:1, pp:1-15 [Journal ] Formal Series of General Algebras over a Field and Their Syntactic Algebras. [Citation Graph (, )][DBLP ] Weighted Tree-Walking Automata. [Citation Graph (, )][DBLP ] Search in 0.006secs, Finished in 0.009secs