Edit Profile (opens in new tab) Vágvölgyi, Sándor Co-Author Distance Author ID: vagvolgyi.sandor Published as: Vágvölgyi, Sándor; Vágvölgyi, S.; Vágvőlgyi, Sándor; Vàgvölgyi, S. more...less Homepage: http://www.inf.u-szeged.hu/~vagvolgy/ External Links: Google Scholar · dblp Documents Indexed: 66 Publications since 1986 Reviewing Activity: 5 Reviews Co-Authors: 16 Co-Authors with 36 Joint Publications 196 Co-Co-Authors all top 5 Co-Authors 30 single-authored 21 Fülöp, Zoltán 3 Gilleron, Rémi 3 Gyenizse, Pál 3 Salomaa, Kai T. 3 Slutzki, Giora 2 Câmpeanu, Cezar 2 Coquidé, Jean-Luc 2 Dauchet, Max 1 Apró, János 1 Gazdag, Zsolt 1 Herrmann, Frank 1 Hornung, Tamás 1 Jurvanen, Eija 1 Piao, Xiaoxue 1 Steinby, Magnus 1 Vogler, Heiko all top 5 Serials 21 Theoretical Computer Science 8 Acta Cybernetica 5 Information Processing Letters 4 Bulletin of the European Association for Theoretical Computer Science (EATCS) 3 Annales Societatis Mathematicae Polonae. Series IV 3 Bulletin of the European Association for Theoretical Computer Science EATCS 2 Acta Informatica 2 Mathematical Systems Theory 2 Information and Computation 2 International Journal of Foundations of Computer Science 2 Fundamenta Informaticae 2 Journal of Logical and Algebraic Methods in Programming 1 Journal of Automata, Languages and Combinatorics 1 The Journal of Logic and Algebraic Programming all top 5 Fields 66 Computer science (68-XX) 4 Mathematical logic and foundations (03-XX) 2 Game theory, economics, finance, and other social and behavioral sciences (91-XX) 1 Combinatorics (05-XX) 1 General algebraic systems (08-XX) 1 Group theory and generalizations (20-XX) 1 Information and communication theory, circuits (94-XX) Publications by Year all cited Publications top 5 cited Publications Citations contained in zbMATH Open 45 Publications have been cited 235 times in 92 Documents Cited by ▼ Year ▼ Top-down tree transducers with deterministic top-down look-ahead. Zbl 0684.68077 Fülöp, Z.; Vágvölgyi, S. 22 1989 Bottom-up tree pushdown automata: Classification and connection with rewrite systems. Zbl 0805.68083 Coquidé, Jean-Luc; Dauchet, Max; Gilleron, Rémi; Vágvölgyi, Sándor 18 1994 Linear generalized semi-monadic rewrite systems effectively preserve recognizability. Zbl 0902.68092 Gyenizse, Pál; Vágvölgyi, Sándor 15 1998 A complete rewriting system for a monoid of tree transformation classes. Zbl 0705.68068 Fülöp, Z.; Vágvölgyi, S. 10 1990 Shuffle decompositions of regular languages. Zbl 1067.68085 Câmpeanu, C.; Salomaa, K.; Vágvölgyi, S. 9 2002 Results on compositions of deterministic root-to-frontier tree transformations. Zbl 0625.68060 Fülöp, Z.; Vágvölgyi, S. 8 1987 Iterated deterministic top-down look-ahead. Zbl 0759.68064 Fülöp, Z.; Vágvölgyi, S. 8 1989 Ground term rewriting rules for the word problem of ground term equations. Zbl 0757.68069 Fülöp, Zoltán; Vágvölgyi, Sándor 8 1991 A fast algorithm for constructing a tree automaton recognizing a congruential tree language. Zbl 0781.68081 Vágvölgyi, Sándor 8 1993 Tree transducers with external functions. Zbl 0781.68053 Fülöp, Zoltán; Herrmann, Frank; Vágvölgyi, Sándor; Vogler, Heiko 8 1993 For a rewrite system it is decidable whether the set of irreducible, ground terms is recognizable. Zbl 1023.68601 Vágvölgyi, Sándor; Gilleron, Rémi 8 1992 An infinite hierarchy of tree transformations in the class \({\mathcal N}{\mathcal D}{\mathcal R}\). Zbl 0638.68089 Vágvölgyi, S.; Fülöp, Z. 7 1987 Congruential complements of ground term rewrite systems. Zbl 0944.68077 Vágvölgyi, S. 7 2000 Congruential tree languages are the same as recognizable tree languages - a proof for a theorem of D. Kozen. Zbl 0693.68046 Fülöp, Z.; Vágvölgyi, S. 7 1989 On domains of tree transducers. Zbl 0676.68026 Fülöp, Z.; Vágvölgyi, S. 6 1988 A characterization of irreducible sets modulo left-linear term rewriting systems by tree automata. Zbl 0705.68080 Fülop, Z.; Vágvölgyi, S. 6 1990 Minimal equational representations of recognizable tree languages. Zbl 0865.68071 Fülöp, Zoltán; Vágvölgyi, Sándor 5 1997 Top-down tree transducers with two-way tree walking look-ahead. Zbl 0753.68071 Vágvölgyi, Sándor 5 1992 Deterministic top-down tree transducers with iterated look-ahead. Zbl 0873.68137 Slutzki, Giora; Vágvölgyi, Sándor 5 1995 Decidability of the inclusion in monoids generated by tree transformation classes. Zbl 0791.68091 Fülöp, Zoltán; Vágvölgyi, Sándor 5 1992 Bottom-up tree pushdown automata and rewrite systems. Zbl 1503.68096 Coquidé, J-L.; Dauchet, M.; Gilleron, R.; Vàgvölgyi, S. 5 1991 Attributed tree transducers cannot induce all deterministic bottom-up tree transformations. Zbl 0827.68067 Fülöp, Zoltán; Vágvölgyi, Sándor 4 1995 Restricted ground tree transducers. Zbl 0952.68078 Fülöp, Z.; Vágvölgyi, S. 4 2001 Compositions of deterministic bottom-up, top-down, and regular look-ahead tree transformations. Zbl 0871.68136 Gyenizse, Pál; Vágvölgyi, Sándor 4 1996 A hierarchy of deterministic top-down tree transformations. Zbl 0794.68080 Slutzki, Giora; Vágvölgyi, Sándor 4 1993 On ranges of compositions of deterministic root-to-frontier tree transformations. Zbl 0662.68076 Fülöp, Z.; Vágvölgyi, S. 3 1987 Variants of top-down tree transducers with look-ahed. Zbl 0676.68035 Fülöp, Zoltán; Vágvölgyi, Sándor 3 1988 Simple and minimal ground term equation systems. Zbl 0930.68071 Vágvölgyi, Sándor 3 1998 On one-pass term rewriting. Zbl 0926.68061 Fülöp, Zoltán; Jurvanen, Eija; Steinby, Magnus; Vágvölgyi, Sándor 3 1999 Shuffle quotient and decompositions. Zbl 1073.68664 Câmpeanu, C.; Salomaa, K.; Vágvölgyi, S. 3 2002 A complete classification of deterministic root-to-frontier tree transformation classes. Zbl 0729.68048 Fülöp, Z.; Vágvölgyi, S. 3 1991 On compositions of root-to-frontier tree transformations. Zbl 0624.68069 Vágvölgyi, S. 3 1986 A property of left-linear rewrite systems preserving recognizability. Zbl 0944.68082 Gyenizse, Pál; Vágvölgyi, Sándor 2 2000 Intersection of finitely generated congruences over the term algebra with equal trunks. Zbl 0973.68110 Vágvőlgyi, Sándor 2 2000 The ground tree transducer game. Zbl 0903.68124 Vágvölgyi, Sándor 2 1998 Descendants of a recognizable tree language for sets of linear monadic term rewrite rules. Zbl 1184.68302 Vágvölgyi, Sándor 2 2006 Term rewriting restricted to ground terms. Zbl 1046.68066 Vágvölgyi, Sándor 2 2003 CHAP and rewrite components. Zbl 1244.68011 Vágvölgyi, Sándor 1 2011 Congruences generated by extended ground term rewrite systems. Zbl 1209.68292 Vágvölgyi, Sándor 1 2009 The ground tree transducer game with identical tree automata. Zbl 1006.91005 Apró, János; Vágvőlgyi, Sándor 1 2001 Right-linear half-monadic term rewrite systems. Zbl 1070.68058 Vágvölgyi, Sándor 1 2003 A characterization of irreducible sets modulo left-linear term rewriting systems by tree automata. Zbl 0708.68027 Fülöp, Z.; Vágvölgyi, S. 1 1989 Minimization of deterministic top-down tree automata. Zbl 1389.68042 Fülöp, Zoltán; Vágvölgyi, Sándor 1 2017 Intersection of finitely generated congruences over term algebra. Zbl 1028.68075 Vágvölgyi, Sándor 1 2003 One-pass reductions. Zbl 1363.68090 Vágvölgyi, Sándor 1 2016 Minimization of deterministic top-down tree automata. Zbl 1389.68042 Fülöp, Zoltán; Vágvölgyi, Sándor 1 2017 One-pass reductions. Zbl 1363.68090 Vágvölgyi, Sándor 1 2016 CHAP and rewrite components. Zbl 1244.68011 Vágvölgyi, Sándor 1 2011 Congruences generated by extended ground term rewrite systems. Zbl 1209.68292 Vágvölgyi, Sándor 1 2009 Descendants of a recognizable tree language for sets of linear monadic term rewrite rules. Zbl 1184.68302 Vágvölgyi, Sándor 2 2006 Term rewriting restricted to ground terms. Zbl 1046.68066 Vágvölgyi, Sándor 2 2003 Right-linear half-monadic term rewrite systems. Zbl 1070.68058 Vágvölgyi, Sándor 1 2003 Intersection of finitely generated congruences over term algebra. Zbl 1028.68075 Vágvölgyi, Sándor 1 2003 Shuffle decompositions of regular languages. Zbl 1067.68085 Câmpeanu, C.; Salomaa, K.; Vágvölgyi, S. 9 2002 Shuffle quotient and decompositions. Zbl 1073.68664 Câmpeanu, C.; Salomaa, K.; Vágvölgyi, S. 3 2002 Restricted ground tree transducers. Zbl 0952.68078 Fülöp, Z.; Vágvölgyi, S. 4 2001 The ground tree transducer game with identical tree automata. Zbl 1006.91005 Apró, János; Vágvőlgyi, Sándor 1 2001 Congruential complements of ground term rewrite systems. Zbl 0944.68077 Vágvölgyi, S. 7 2000 A property of left-linear rewrite systems preserving recognizability. Zbl 0944.68082 Gyenizse, Pál; Vágvölgyi, Sándor 2 2000 Intersection of finitely generated congruences over the term algebra with equal trunks. Zbl 0973.68110 Vágvőlgyi, Sándor 2 2000 On one-pass term rewriting. Zbl 0926.68061 Fülöp, Zoltán; Jurvanen, Eija; Steinby, Magnus; Vágvölgyi, Sándor 3 1999 Linear generalized semi-monadic rewrite systems effectively preserve recognizability. Zbl 0902.68092 Gyenizse, Pál; Vágvölgyi, Sándor 15 1998 Simple and minimal ground term equation systems. Zbl 0930.68071 Vágvölgyi, Sándor 3 1998 The ground tree transducer game. Zbl 0903.68124 Vágvölgyi, Sándor 2 1998 Minimal equational representations of recognizable tree languages. Zbl 0865.68071 Fülöp, Zoltán; Vágvölgyi, Sándor 5 1997 Compositions of deterministic bottom-up, top-down, and regular look-ahead tree transformations. Zbl 0871.68136 Gyenizse, Pál; Vágvölgyi, Sándor 4 1996 Deterministic top-down tree transducers with iterated look-ahead. Zbl 0873.68137 Slutzki, Giora; Vágvölgyi, Sándor 5 1995 Attributed tree transducers cannot induce all deterministic bottom-up tree transformations. Zbl 0827.68067 Fülöp, Zoltán; Vágvölgyi, Sándor 4 1995 Bottom-up tree pushdown automata: Classification and connection with rewrite systems. Zbl 0805.68083 Coquidé, Jean-Luc; Dauchet, Max; Gilleron, Rémi; Vágvölgyi, Sándor 18 1994 A fast algorithm for constructing a tree automaton recognizing a congruential tree language. Zbl 0781.68081 Vágvölgyi, Sándor 8 1993 Tree transducers with external functions. Zbl 0781.68053 Fülöp, Zoltán; Herrmann, Frank; Vágvölgyi, Sándor; Vogler, Heiko 8 1993 A hierarchy of deterministic top-down tree transformations. Zbl 0794.68080 Slutzki, Giora; Vágvölgyi, Sándor 4 1993 For a rewrite system it is decidable whether the set of irreducible, ground terms is recognizable. Zbl 1023.68601 Vágvölgyi, Sándor; Gilleron, Rémi 8 1992 Top-down tree transducers with two-way tree walking look-ahead. Zbl 0753.68071 Vágvölgyi, Sándor 5 1992 Decidability of the inclusion in monoids generated by tree transformation classes. Zbl 0791.68091 Fülöp, Zoltán; Vágvölgyi, Sándor 5 1992 Ground term rewriting rules for the word problem of ground term equations. Zbl 0757.68069 Fülöp, Zoltán; Vágvölgyi, Sándor 8 1991 Bottom-up tree pushdown automata and rewrite systems. Zbl 1503.68096 Coquidé, J-L.; Dauchet, M.; Gilleron, R.; Vàgvölgyi, S. 5 1991 A complete classification of deterministic root-to-frontier tree transformation classes. Zbl 0729.68048 Fülöp, Z.; Vágvölgyi, S. 3 1991 A complete rewriting system for a monoid of tree transformation classes. Zbl 0705.68068 Fülöp, Z.; Vágvölgyi, S. 10 1990 A characterization of irreducible sets modulo left-linear term rewriting systems by tree automata. Zbl 0705.68080 Fülop, Z.; Vágvölgyi, S. 6 1990 Top-down tree transducers with deterministic top-down look-ahead. Zbl 0684.68077 Fülöp, Z.; Vágvölgyi, S. 22 1989 Iterated deterministic top-down look-ahead. Zbl 0759.68064 Fülöp, Z.; Vágvölgyi, S. 8 1989 Congruential tree languages are the same as recognizable tree languages - a proof for a theorem of D. Kozen. Zbl 0693.68046 Fülöp, Z.; Vágvölgyi, S. 7 1989 A characterization of irreducible sets modulo left-linear term rewriting systems by tree automata. Zbl 0708.68027 Fülöp, Z.; Vágvölgyi, S. 1 1989 On domains of tree transducers. Zbl 0676.68026 Fülöp, Z.; Vágvölgyi, S. 6 1988 Variants of top-down tree transducers with look-ahed. Zbl 0676.68035 Fülöp, Zoltán; Vágvölgyi, Sándor 3 1988 Results on compositions of deterministic root-to-frontier tree transformations. Zbl 0625.68060 Fülöp, Z.; Vágvölgyi, S. 8 1987 An infinite hierarchy of tree transformations in the class \({\mathcal N}{\mathcal D}{\mathcal R}\). Zbl 0638.68089 Vágvölgyi, S.; Fülöp, Z. 7 1987 On ranges of compositions of deterministic root-to-frontier tree transformations. Zbl 0662.68076 Fülöp, Z.; Vágvölgyi, S. 3 1987 On compositions of root-to-frontier tree transformations. Zbl 0624.68069 Vágvölgyi, S. 3 1986 all cited Publications top 5 cited Publications all top 5 Cited by 73 Authors 31 Vágvölgyi, Sándor 11 Fülöp, Zoltán 8 Engelfriet, Joost 8 Salomaa, Kai T. 6 Vogler, Heiko 5 Kühnemann, Armin 4 Domaratzki, Michael 4 Gyenizse, Pál 4 Maneth, Sebastian 3 Dauchet, Max 3 Godoy, Guillem 3 Jacquemard, Florent 3 McQuillan, Ian 2 Biegler, Franziska 2 Coquidé, Jean-Luc 2 Courbis, Roméo 2 Creus, Carles 2 Daley, Mark 2 Dányi, Gábor 2 Drewes, Frank 2 Genet, Thomas 2 Gilleron, Rémi 2 Héam, Pierre-Cyrille 2 Hofbauer, Dieter 2 Huber, Maria 2 Kouchnarenko, Olga 2 Ramos, Lander 2 Seidl, Helmut 2 Slutzki, Giora 2 Veanes, Margus 1 André, Yves 1 Bloem, Roderick 1 Boichut, Yohan 1 Bossut, Francis 1 Degtyarev, Anatoli Ivanovich 1 Dershowitz, Nachum 1 Eremondi, Joey 1 Fettig, Roland 1 Feuillade, Guillaume 1 Friese, Sylvia 1 Ganzinger, Harald 1 Gascón, Adrià 1 Gazdag, Zsolt 1 Göller, Stefan 1 Gurevich, Yuri 1 Halava, Vesa 1 Harju, Tero 1 Helbing, A. 1 Holzer, Markus 1 Hornung, Tamás 1 Ibarra, Oscar H. 1 Jouannaud, Jean-Pierre 1 Klop, Jan Willem 1 Kojima, Yoshiharu 1 Kucherov, G. A. 1 Kunc, Michal 1 Lin, Anthony Widjaja 1 Nagaya, Takashi 1 Narendran, Paliath 1 Okhotin, Alexander 1 Otto, Friedrich 1 Rahonis, George 1 Réty, Pierre 1 Rusinowitch, Michaël 1 Sahla, Esa 1 Sakai, Masahiko 1 Schmid, Klaus 1 Tison, Sophie 1 Tommasi, Marc 1 Toyama, Yoshihito 1 Viet Triem Tong, Valérie 1 Vuotto, Julie 1 Yen, Hsuchun all top 5 Cited in 14 Serials 36 Theoretical Computer Science 9 Information Processing Letters 8 Information and Computation 5 Journal of Computer and System Sciences 3 Mathematical Systems Theory 3 International Journal of Foundations of Computer Science 3 Journal of Logical and Algebraic Methods in Programming 2 Acta Informatica 1 SIAM Journal on Computing 1 Optimization 1 Journal of Symbolic Computation 1 Journal of Automated Reasoning 1 Applicable Algebra in Engineering, Communication and Computing 1 Fundamenta Informaticae all top 5 Cited in 6 Fields 91 Computer science (68-XX) 8 Mathematical logic and foundations (03-XX) 2 Group theory and generalizations (20-XX) 1 General algebraic systems (08-XX) 1 Operations research, mathematical programming (90-XX) 1 Information and communication theory, circuits (94-XX) Citations by Year