Dr. Vágvölgyi Sándor munkatársi adatlapjához felhasznált adatok Publikációk: Lektorált folyóirat cikk: Sándor Vágvölgyi: Intersection of finitely generated congruences over term algebra. Theor. Comput. Sci. 1-3(300): 209-234 (2003) Sándor Vágvölgyi: Term rewriting restricted to ground terms. Theor. Comput. Sci. 1-3(302): 135-165 (2003) Sándor Vágvölgyi: On ground tree transformations and congruences induced by tree automata. Theor. Comput. Sci. 1-3(304): 449-459 (2003) Sándor Vágvölgyi: Right-linear half-monadic term rewrite systems. Theor. Comput. Sci. 309(1-3): 195-211 (2003) Zoltán Fülöp, Sándor Vágvölgyi: Restricted ground tree transducers. Theor. Comput. Sci. 250(1-2): 219-233 (2001) János Apró, Sándor Vágvölgyi: The Ground Tree Transducer Game with Identical Tree Automata. Fundam. Inform. 45(3): 157-172 (2001) Cezar Câmpeanu, Kai Salomaa, Sándor Vágvölgyi: Shuffle Quotient and Decompositions. Developments in Language Theory 2001: 186-196 Sándor Vágvölgyi: Congruential complements of ground term rewrite systems. Theor. Comput. Sci. 238(1-2): 247-274 (2000) Pál Gyenizse, Sándor Vágvölgyi: A property of left-linear rewrite systems preserving recognizability. Theor. Comput. Sci. 242(1-2): 477-498 (2000) Nem lektorált folyóirat cikk Sándor Vágvölgyi: Intersection of Finitely Generated Congruences over the Term Algebra with Equal Trunks. Bulletin of the EATCS 71: 167-187 (2000) S. Vágvölgyi. Left-linear Right-ground Term Rewrite Systems and Ground Term Rewrite Systems. Bulletin of the European Association for Theoretical Computer Science, 82:269, February (2004) Konferencia kiadvány, proceeding: Cezar Câmpeanu, Kai Salomaa, Sándor Vágvölgyi: Shuffle Decompositions of Regular Languages. Int. J. Found. Comput. Sci. 13(6): 799-816 (2002) Hívatkozások Title: Minimal equational representations of recognizable tree languages Author(s): Fulop Z, Vagvolgyi S Source: ACTA INFORMATICA 34 (1): 59-84 JAN 1997 Document Type: Article Language: English Hívatkozások: Salehi S A completeness property of Wilke's tree algebras LECTURE NOTES IN COMPUTER SCIENCE 2747: 662-670 2003 Title: ATTRIBUTED TREE-TRANSDUCERS CANNOT INDUCE ALL DETERMINISTIC BOTTOM-UP TREE-TRANSFORMATIONS Author(s): FULOP Z, VAGVOLGYI S Source: INFORMATION AND COMPUTATION 116 (2): 231-240 FEB 1 1995 Document Type: Article Language: English Hívatkozások: Bloem R, Engelfriet J A comparison of tree transductions defined by monadic second order logic and by attribute grammars JOURNAL OF COMPUTER AND SYSTEM SCIENCES 61 (1): 1-50 AUG 2000 TOP-DOWN TREE-TRANSDUCERS WITH DETERMINISTIC TOP-DOWN LOOK-AHEAD Author(s): FULOP Z, VAGVOLGYI S Source: INFORMATION PROCESSING LETTERS 33 (1): 3-5 OCT 27 1989 Document Type: Article Language: English Hívatkozások: Rahonis G Alphabetic pushdown tree transducers LECTURE NOTES IN COMPUTER SCIENCE 2710: 423-436 2003 Rahonis G Alphabetic and synchronized tree transducers THEORETICAL COMPUTER SCIENCE 255 (1-2): 377-399 MAR 28 2001 Title: Shuffle quotient and decompositions Author(s): Campeanu C, Salomaa K, Vagvolgyi S Source: DEVELOPMENTS IN LANGUAGE THEORY LECTURE NOTES IN COMPUTER SCIENCE 2295: 186-196 2002 Document Type: Article Hívatkozások: Ito M, Sugiura R n-insertion on languages LECTURE NOTES IN COMPUTER SCIENCE 2950: 213-218 2004 Title: VARIANTS OF TOP-DOWN TREE-TRANSDUCERS WITH LOOK-AHEAD Author(s): FULOP Z, VAGVOLGYI S Source: MATHEMATICAL SYSTEMS THEORY 21 (3): 125-145 1989 Document Type: Article Language: English Hívatkozások: Drewes F, Engelfriet J Branching synchronization grammars with nested tables JOURNAL OF COMPUTER AND SYSTEM SCIENCES 68 (3): 611-656 MAY 2004 Hívatkozások: Rahonis G Alphabetic pushdown tree transducers LECTURE NOTES IN COMPUTER SCIENCE 2710: 423-436 2003 Rahonis G Alphabetic and synchronized tree transducers THEORETICAL COMPUTER SCIENCE 255 (1-2): 377-399 MAR 28 2001 Title: Linear generalized semi-monadic rewrite systems effectively preserve recognizability Author(s): Gyenizse P, Vagvolgyi S Source: THEORETICAL COMPUTER SCIENCE 194 (1-2): 87-122 MAR 10 1998 Document Type: Article Language: English Hívatkozások: Takai T A verification technique using term rewriting systems and abstract interpretation LECTURE NOTES IN COMPUTER SCIENCE 3091: 119-133 2004 Limet S, Salzer G Proving properties of term rewrite systems via logic programs LECTURE NOTES IN COMPUTER SCIENCE 3091: 170-184 2004 Title: BOTTOM-UP TREE PUSHDOWN-AUTOMATA - CLASSIFICATION AND CONNECTION WITH REWRITE SYSTEMS Author(s): COQUIDE JL, DAUCHET M, GILLERON R, VAGVOLGYI S Source: THEORETICAL COMPUTER SCIENCE 127 (1): 69-98 MAY 9 1994 Hívatkozások: Nitta N, Seki H An extension of pushdown system and its model checking method LECTURE NOTES IN COMPUTER SCIENCE 2761: 281-295 2003 Takai T, Seki H, Fujinaka Y, et al. Layered transducing term rewriting system and its recognizability preserving property IEICE TRANSACTIONS ON INFORMATION AND SYSTEMS E86D (2): 285-295 FEB 2003 Loding C Model-checking infinite systems generated by ground tree rewriting LECTURE NOTES IN COMPUTER SCIENCE 2303: 280-294 2002 Seki H, Takai T, Fujinaka Y, et al. Layered transducing term rewriting system and its recognizability preserving property LECTURE NOTES IN COMPUTER SCIENCE 2378: 98-113 2002 Nagaya T, Toyama Y Decidability for left-linear growing term rewriting systems INFORMATION AND COMPUTATION 178 (2): 499-514 NOV 1 2002 Tison S Nee automata and term rewrite systems (Extended abstract) LECTURE NOTES IN COMPUTER SCIENCE 1833: 27-30 2000 Takai T, Kaji Y, Seki H Right-linear finite path overlapping term rewriting systems effectively preserve recognizability LECTURE NOTES IN COMPUTER SCIENCE 1833: 246-260 2000 Title: TREE-TRANSDUCERS WITH EXTERNAL FUNCTIONS Author(s): FULOP Z, HERRMANN F, VAGVOLGYI S, VOGLER H Source: THEORETICAL COMPUTER SCIENCE 108 (2): 185-236 FEB 15 1993 Document Type: Article Language: English Hívatkozások: Kuhnemann A A two-dimensional hierarchy for attributed tree transducers LECTURE NOTES IN COMPUTER SCIENCE 1279: 281-292 1997 Bloem R, Engelfriet J A comparison of tree transductions defined by monadic second order logic and by attribute grammars JOURNAL OF COMPUTER AND SYSTEM SCIENCES 61 (1): 1-50 AUG 2000 OTKA projektek: Játékok a számítástudományban OTKA: T 022994 Témavezető neve: Dr. Vágvölgyi Sándor Össztámogatás : 805 eFt Kutatási időszak: 1997-2000. OTKA T 022994 projekt zárójelentés (postscript állomány) Term-feldolgozó számítástudományi modellek vizsgálata OTKA T 030084 összeg: 2.556 eFt futamidő: 4 év kezdes időpontja: 1999. január 1. befejezés időpontja: 2002. december 31. publikációim száma: 4 részvétel jellege: közremuködő Témavezető: Dr. Fülöp Zoltán Automaták, fák és logika Támogató: OTKA T 046686 Témavezeto Dr. Fülöp Zoltán Összeg: 9 102 eFt Résztvevok száma: témavezeto + 3 fo Futamido: 2004-2007