| Bottom-up tree pushdown automata: classification and connection with rewrite systems JL Coquidé, M Dauchet, R Gilleron, S Vágvölgyi Theoretical Computer Science 127 (1), 69-98, 1994 | 87 | 1994 |
| Linear generalized semi-monadic rewrite systems effectively preserve recognizability P Gyenizse, S Vágvölgyi Theoretical Computer Science 194 (1-2), 87-122, 1998 | 66 | 1998 |
| Bottom-up tree pushdown automata and rewrite systems JL Coquidé, M Dauchet, R Gilleron, S Vágvölgyi Rewriting Techniques and Applications: 4th International Conference, RTA-91 …, 1991 | 33 | 1991 |
| Ground term rewriting rules for the word problem of ground term equations Z Fueloep, S Vagvoelgyi Bulletin of the EATCS 45, 186-201, 1991 | 32 | 1991 |
| For a rewrite system it is decidable whether the set of irreducible ground terms is recognizable. S Vágvölgyi, R Gilleron Bulletin-European Association for Theoretical Computer Science 48, 197--209, 1992 | 29 | 1992 |
| Variants of top-down tree transducers with look-ahead Z Fülöp, S Vágvölgyi Mathematical systems theory 21 (1), 125-145, 1988 | 29 | 1988 |
| Congruential tree languages are the same as recognizable tree languages - a proof for a theorem of D. Kozen Z Fueloep, S Vagvoelgyi Bulletin of the EATCS 39, 175-184, 1989 | 24 | 1989 |
| Tree transducers with external functions Z Fülöp, F Herrmann, S Vágvölgyi, H Vogler Theoretical computer science 108 (2), 185-236, 1993 | 23 | 1993 |
| Minimal equational representations of recognizable tree languages Z Fülöp, S Vágvölgyi Acta Informatica 34, 59-84, 1997 | 21 | 1997 |
| A fast algorithm for constructing a tree automaton recognizing a congruential tree language S Vágvölgyi Theoretical computer science 115 (2), 391-399, 1993 | 20 | 1993 |
| A characterization of irreducible sets modulo left-linear term rewriting systems by tree automata Z Fülop, S Vágvölgyi Fundamenta Informaticae 13 (2), 211-226, 1990 | 18 | 1990 |
| Top-down tree transducers with deterministic top-down look-ahead Z Fueloep, S Vagvoelgyi Information processing letters 33 (1), 3-5, 1989 | 17 | 1989 |
| On one-pass term rewriting Z Fülöp, E Jurvanen, M Steinby, S Vágvölgyi Mathematical Foundations of Computer Science 1998: 23rd International …, 1998 | 16 | 1998 |
| Iterated deterministic top-down look-ahead Z Fülöp, S Vágvölgyi Fundamentals of Computation Theory: International Conference FCT'89 Szeged …, 1989 | 16 | 1989 |
| Results on compositions of deterministic root-to-frontier tree transformations Z Fülöp, S Vágvölgyi Acta Cybernetica 8 (1), 49-61, 1987 | 16 | 1987 |
| Shuffle decompositions of regular languages C Campeanu, K Salomaa, S Vágvölgyi International Journal of Foundations of Computer Science 13 (06), 799-816, 2002 | 15 | 2002 |
| Shuffle quotient and decompositions C Câmpeanu, K Salomaa, S Vágvölgyi International Conference on Developments in Language Theory, 186-196, 2001 | 15 | 2001 |
| Restricted ground tree transducers Z Fülöp, S Vágvölgyi Theoretical computer science 250 (1-2), 219-233, 2001 | 13 | 2001 |
| Congruential complements of ground term rewrite systems S Vágvölgyi Theoretical Computer Science 238 (1-2), 247-274, 2000 | 11 | 2000 |
| Deterministic top-down tree transducers with iterated look-ahead G Slutzki, S Vágvölgyi Theoretical Computer Science 143 (2), 285-308, 1995 | 11 | 1995 |