| 2009 |
|---|
| 50 | EE | Sándor Vágvölgyi:
On ground word problem of term equation systems
CoRR abs/0902.4348: (2009) |
| 49 | EE | Sándor Vágvölgyi:
Deterministic bottom-up tree transducers and ground term rewrite systems.
Theor. Comput. Sci. 410(21-23): 2250-2278 (2009) |
| 2008 |
|---|
| 48 | EE | Sándor Vágvölgyi:
Murg term rewrite systems.
Inf. Process. Lett. 108(5): 264-272 (2008) |
| 2007 |
|---|
| 47 | EE | Sándor Vágvölgyi:
Losing recognizability.
Theor. Comput. Sci. 379(1-2): 298-304 (2007) |
| 2006 |
|---|
| 46 | EE | Sándor Vágvölgyi:
Descendants of a recognizable tree language for sets of linear monadic term rewrite rules.
Inf. Process. Lett. 99(3): 111-118 (2006) |
| 2004 |
|---|
| 45 | | Sándor Vágvölgyi:
Left-linear Right-ground Term Rewrite Systems and Ground Term Rewrite Systems.
Bulletin of the EATCS 82: 269-285 (2004) |
| 44 | EE | Tamás Hornung,
Sándor Vágvölgyi:
Storage-to-tree transducers with look-ahead.
Theor. Comput. Sci. 329(1-3): 115-158 (2004) |
| 2003 |
|---|
| 43 | EE | Sándor Vágvölgyi:
On ground tree transformations and congruences induced by tree automata.
Theor. Comput. Sci. 1-3(304): 449-459 (2003) |
| 42 | EE | Sándor Vágvölgyi:
Intersection of finitely generated congruences over term algebra.
Theor. Comput. Sci. 300(1-3): 209-234 (2003) |
| 41 | EE | Sándor Vágvölgyi:
Term rewriting restricted to ground terms.
Theor. Comput. Sci. 302(1-3): 135-165 (2003) |
| 40 | EE | Sándor Vágvölgyi:
Right-linear half-monadic term rewrite systems.
Theor. Comput. Sci. 309(1-3): 195-211 (2003) |
| 2002 |
|---|
| 39 | EE | 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) |
| 2001 |
|---|
| 38 | EE | Cezar Câmpeanu,
Kai Salomaa,
Sándor Vágvölgyi:
Shuffle Quotient and Decompositions.
Developments in Language Theory 2001: 186-196 |
| 37 | | János Apró,
Sándor Vágvölgyi:
The Ground Tree Transducer Game with Identical Tree Automata.
Fundam. Inform. 45(3): 157-172 (2001) |
| 36 | EE | Zoltán Fülöp,
Sándor Vágvölgyi:
Restricted ground tree transducers.
Theor. Comput. Sci. 250(1-2): 219-233 (2001) |
| 2000 |
|---|
| 35 | | 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) |
| 34 | EE | Sándor Vágvölgyi:
Congruential complements of ground term rewrite systems.
Theor. Comput. Sci. 238(1-2): 247-274 (2000) |
| 33 | EE | 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) |
| 1999 |
|---|
| 32 | EE | Zoltán Fülöp,
Eija Jurvanen,
Magnus Steinby,
Sándor Vágvölgyi:
On One-Pass Term Rewriting.
Acta Cybern. 14(1): 83-98 (1999) |
| 1998 |
|---|
| 31 | EE | Zoltán Fülöp,
Eija Jurvanen,
Magnus Steinby,
Sándor Vágvölgyi:
On One-Pass Term Rewriting.
MFCS 1998: 248-256 |
| 30 | | Sándor Vágvölgyi:
The Ground Tree Transducer Game.
Fundam. Inform. 34(1-2): 175-201 (1998) |
| 29 | | Sándor Vágvölgyi:
Simple and Minimal Ground Term Equation Systems.
Fundam. Inform. 36(4): 367-413 (1998) |
| 28 | EE | Pál Gyenizse,
Sándor Vágvölgyi:
Linear Generalized Semi-Monadic Rewrite Systems Effectively Preserve Recognizability.
Theor. Comput. Sci. 194(1-2): 87-122 (1998) |
| 1997 |
|---|
| 27 | | Zoltán Fülöp,
Sándor Vágvölgyi:
Minimal Equational Representations of Recognizable Tree Languages.
Acta Inf. 34(1): 59-84 (1997) |
| 1996 |
|---|
| 26 | | Giora Slutzki,
Sándor Vágvölgyi:
A Hierarchy of Deterministic Top-Down Tree Transformations.
Mathematical Systems Theory 29(2): 169-188 (1996) |
| 25 | EE | Pál Gyenizse,
Sándor Vágvölgyi:
Compositions of Deterministic Bottom-Up, Top-Down, and Regular Look-Ahead Tree Transformations.
Theor. Comput. Sci. 156(1&2): 71-97 (1996) |
| 1995 |
|---|
| 24 | | Zoltán Fülöp,
Sándor Vágvölgyi:
Attributed Tree Transducers Cannot Induce all Deterministic Bottom-Up Tree Transformations
Inf. Comput. 116(2): 231-240 (1995) |
| 23 | EE | Giora Slutzki,
Sándor Vágvölgyi:
Deterministic Top-Down Tree Transducers with Iterated Lookahead.
Theor. Comput. Sci. 143(2): 285-308 (1995) |
| 1994 |
|---|
| 22 | | Jean-Luc Coquidé,
Max Dauchet,
Rémi Gilleron,
Sándor Vágvölgyi:
Bottom-Up Tree Pushdown Automata: Classification and Connection with Rewrite Systems.
Theor. Comput. Sci. 127(1): 69-98 (1994) |
| 1993 |
|---|
| 21 | | Giora Slutzki,
Sándor Vágvölgyi:
A Hierarchy of Deterministic Top-down Tree Transformations.
FCT 1993: 440-451 |
| 20 | | Zoltán Fülöp,
Frank Herrmann,
Sándor Vágvölgyi,
Heiko Vogler:
Tree Transducers with External Functions.
Theor. Comput. Sci. 108(2): 185-236 (1993) |
| 19 | | Sándor Vágvölgyi:
A Fast Algorithm for Constructing a Tree Automaton Recognizing a Congruential Tree Language.
Theor. Comput. Sci. 115(2): 391-399 (1993) |
| 1992 |
|---|
| 18 | | Zoltán Fülöp,
Sándor Vágvölgyi:
Decidability of the inclusion in monoids generated by tree transformation classes.
Tree Automata and Languages 1992: 381-408 |
| 17 | | Sándor Vágvölgyi,
Rémi Gilleron:
For a rewrite system it is decidable whether the set of irreducible, ground terms is regognizable.
Bulletin of the EATCS 48: 197-209 (1992) |
| 16 | | Sándor Vágvölgyi:
Top-Down Tree Transducers with Two-Way Tree Walking Look-Ahead.
Theor. Comput. Sci. 93(1): 43-74 (1992) |
| 1991 |
|---|
| 15 | | Jean-Luc Coquidé,
Max Dauchet,
Rémi Gilleron,
Sándor Vágvölgyi:
Bottom-Up Tree Pushdown Automata and Rewrite Systems.
RTA 1991: 287-298 |
| 14 | | Zoltán Fülöp,
Sándor Vágvölgyi:
Ground Term Rewriting Rules for the Word Problem of Ground Term Equations.
Bulletin of the EATCS 45: 186-201 (1991) |
| 13 | | Zoltán Fülöp,
Sándor Vágvölgyi:
A Complete Classification of Deterministic Root-To-Frontier Tree Transformation Classes.
Theor. Comput. Sci. 81(1): 1-15 (1991) |
| 1990 |
|---|
| 12 | | Zoltán Fülöp,
Sándor Vágvölgyi:
A Complete Rewriting System for a Monoid of Tree Transformation Classes
Inf. Comput. 86(2): 195-212 (1990) |
| 11 | | Zoltán Fülöp,
Sándor Vágvölgyi:
The Emptiness Problem is Undecidable for Domains of Partial Monadic 2-Modular Tree Transformations.
Inf. Process. Lett. 36(6): 293-296 (1990) |
| 1989 |
|---|
| 10 | | Zoltán Fülöp,
Sándor Vágvölgyi:
Iterated Deterministic Top-Down Look-Ahead.
FCT 1989: 175-184 |
| 9 | | 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.
Bulletin of the EATCS 39: 175-184 (1989) |
| 8 | | Zoltán Fülöp,
Sándor Vágvölgyi:
Top-Down Tree Transducers with Deterministic Top-Down Look-Ahead.
Inf. Process. Lett. 33(1): 3-5 (1989) |
| 7 | | Zoltán Fülöp,
Sándor Vágvölgyi:
Variants of Top-Down Tree Transducers With Look-Ahead.
Mathematical Systems Theory 21(3): 125-145 (1989) |
| 1988 |
|---|
| 6 | | Zoltán Fülöp,
Sándor Vágvölgyi:
A Characterization of Irreducible Sets Modulo Left-Linear Term Rewriting Systems by Tree Automata.
ALP 1988: 157 |
| 5 | | Sándor Vágvölgyi,
Zoltán Fülöp:
On ranges of compositions of deterministic root-to-frontier tree transformations.
Acta Cybern. 8: 259-266 (1988) |
| 4 | | Zoltán Fülöp,
Sándor Vágvölgyi:
On domains of tree tranducers.
Bulletin of the EATCS 34: 55-61 (1988) |
| 1987 |
|---|
| 3 | | Sándor Vágvölgyi,
Zoltán Fülöp:
An infinite hierarchy of tree transformations in the cals NDR.
Acta Cybern. 8: 153-168 (1987) |
| 2 | | Zoltán Fülöp,
Sándor Vágvölgyi:
Results on compositions of deterministic root-to-frontier tree transformations.
Acta Cybern. 8: 49-61 (1987) |
| 1986 |
|---|
| 1 | | Sándor Vágvölgyi:
On the compositions of root-to-frontier tree tranformations.
Acta Cybern. 7(4): 443-484 (1986) |
