The SCEAS System
Navigation Menu

Search the dblp DataBase

Title:
Author:

Sándor Vágvölgyi: [Publications] [Author Rank by year] [Co-authors] [Prefers] [Cites] [Cited by]

Publications of Author

  1. 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]
  2. Cezar Câmpeanu, Kai Salomaa, Sándor Vágvölgyi
    Shuffle Quotient and Decompositions. [Citation Graph (0, 0)][DBLP]
    Developments in Language Theory, 2001, pp:186-196 [Conf]
  3. 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]
  4. Giora Slutzki, Sándor Vágvölgyi
    A Hierarchy of Deterministic Top-down Tree Transformations. [Citation Graph (0, 0)][DBLP]
    FCT, 1993, pp:440-451 [Conf]
  5. 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]
  6. Jean-Luc Coquidé, Max Dauchet, Rémi Gilleron, Sándor Vágvölgyi
    Bottom-Up Tree Pushdown Automata and Rewrite Systems. [Citation Graph (0, 0)][DBLP]
    RTA, 1991, pp:287-298 [Conf]
  7. 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]
  8. 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]
  9. 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]
  10. Sándor Vágvölgyi
    On the compositions of root-to-frontier tree tranformations. [Citation Graph (0, 0)][DBLP]
    Acta Cybern., 1986, v:7, n:4, pp:443-484 [Journal]
  11. 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]
  12. 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]
  13. 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]
  14. 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]
  15. 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]
  16. Sándor Vágvölgyi
    Intersection of Finitely Generated Congruences over the Term Algebra with Equal Trunks. [Citation Graph (0, 0)][DBLP]
    Bulletin of the EATCS, 2000, v:71, n:, pp:167-187 [Journal]
  17. Sándor Vágvölgyi
    Left-linear Right-ground Term Rewrite Systems and Ground Term Rewrite Systems. [Citation Graph (0, 0)][DBLP]
    Bulletin of the EATCS, 2004, v:82, n:, pp:269-285 [Journal]
  18. Sándor Vágvölgyi, Rémi Gilleron
    For a rewrite system it is decidable whether the set of irreducible, ground terms is regognizable. [Citation Graph (0, 0)][DBLP]
    Bulletin of the EATCS, 1992, v:48, n:, pp:197-209 [Journal]
  19. János Apró, Sándor Vágvölgyi
    The Ground Tree Transducer Game with Identical Tree Automata. [Citation Graph (0, 0)][DBLP]
    Fundam. Inform., 2001, v:45, n:3, pp:157-172 [Journal]
  20. Sándor Vágvölgyi
    The Ground Tree Transducer Game. [Citation Graph (0, 0)][DBLP]
    Fundam. Inform., 1998, v:34, n:1-2, pp:175-201 [Journal]
  21. Sándor Vágvölgyi
    Simple and Minimal Ground Term Equation Systems. [Citation Graph (0, 0)][DBLP]
    Fundam. Inform., 1998, v:36, n:4, pp:367-413 [Journal]
  22. 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]
  23. 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]
  24. Cezar Câmpeanu, Kai Salomaa, Sándor Vágvölgyi
    Shuffle Decompositions of Regular Languages. [Citation Graph (0, 0)][DBLP]
    Int. J. Found. Comput. Sci., 2002, v:13, n:6, pp:799-816 [Journal]
  25. 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]
  26. 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]
  27. Sándor Vágvölgyi
    Descendants of a recognizable tree language for sets of linear monadic term rewrite rules. [Citation Graph (0, 0)][DBLP]
    Inf. Process. Lett., 2006, v:99, n:3, pp:111-118 [Journal]
  28. 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]
  29. Giora Slutzki, Sándor Vágvölgyi
    A Hierarchy of Deterministic Top-Down Tree Transformations. [Citation Graph (0, 0)][DBLP]
    Mathematical Systems Theory, 1996, v:29, n:2, pp:169-188 [Journal]
  30. Jean-Luc Coquidé, Max Dauchet, Rémi Gilleron, Sándor Vágvölgyi
    Bottom-Up Tree Pushdown Automata: Classification and Connection with Rewrite Systems. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 1994, v:127, n:1, pp:69-98 [Journal]
  31. 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]
  32. 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]
  33. 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]
  34. Pál Gyenizse, Sándor Vágvölgyi
    A property of left-linear rewrite systems preserving recognizability. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 2000, v:242, n:1-2, pp:477-498 [Journal]
  35. Pál Gyenizse, Sándor Vágvölgyi
    Compositions of Deterministic Bottom-Up, Top-Down, and Regular Look-Ahead Tree Transformations. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 1996, v:156, n:1&2, pp:71-97 [Journal]
  36. Pál Gyenizse, Sándor Vágvölgyi
    Linear Generalized Semi-Monadic Rewrite Systems Effectively Preserve Recognizability. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 1998, v:194, n:1-2, pp:87-122 [Journal]
  37. Tamás Hornung, Sándor Vágvölgyi
    Storage-to-tree transducers with look-ahead. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 2004, v:329, n:1-3, pp:115-158 [Journal]
  38. Giora Slutzki, Sándor Vágvölgyi
    Deterministic Top-Down Tree Transducers with Iterated Lookahead. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 1995, v:143, n:2, pp:285-308 [Journal]
  39. Sándor Vágvölgyi
    Congruential complements of ground term rewrite systems. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 2000, v:238, n:1-2, pp:247-274 [Journal]
  40. Sándor Vágvölgyi
    On ground tree transformations and congruences induced by tree automata. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 2003, v:1, n:304, pp:449-459 [Journal]
  41. Sándor Vágvölgyi
    Term rewriting restricted to ground terms. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 2003, v:302, n:1-3, pp:135-165 [Journal]
  42. Sándor Vágvölgyi
    Intersection of finitely generated congruences over term algebra. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 2003, v:300, n:1-3, pp:209-234 [Journal]
  43. Sándor Vágvölgyi
    Right-linear half-monadic term rewrite systems. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 2003, v:309, n:1-3, pp:195-211 [Journal]
  44. Sándor Vágvölgyi
    Top-Down Tree Transducers with Two-Way Tree Walking Look-Ahead. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 1992, v:93, n:1, pp:43-74 [Journal]
  45. Sándor Vágvölgyi
    A Fast Algorithm for Constructing a Tree Automaton Recognizing a Congruential Tree Language. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 1993, v:115, n:2, pp:391-399 [Journal]
  46. Sándor Vágvölgyi
    Losing recognizability. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 2007, v:379, n:1-2, pp:298-304 [Journal]

  47. On Ranges of Bottom-up Tree Transducers. [Citation Graph (, )][DBLP]


  48. On ground word problem of term equation systems [Citation Graph (, )][DBLP]


  49. Rewriting Preserving Recognizability of Finite Tree Languages [Citation Graph (, )][DBLP]


Search in 0.005secs, Finished in 0.008secs
NOTICE1
System may not be available sometimes or not working properly, since it is still in development with continuous upgrades
NOTICE2
The rankings that are presented on this page should NOT be considered as formal since the citation info is incomplete in DBLP
 
System created by asidirop@csd.auth.gr [http://users.auth.gr/~asidirop/] © 2002
for Data Engineering Laboratory, Department of Informatics, Aristotle University © 2002