default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDSándor Vágvölgyi
Person information
- affiliation: University of Szeged, Hungary
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[i4]Sándor Vágvölgyi:
Union of Finitely Generated Congruences on Ground Term Algebra. CoRR abs/2411.14559 (2024)- 2023
- [j57]Zsolt Gazdag, Sándor Vágvölgyi:
The Component Hierarchy of Chain-Free Cooperating Distributed Regular Tree Grammars Revisited. Int. J. Found. Comput. Sci. 34(4): 411-427 (2023) - 2022
- [j56]Sándor Vágvölgyi
:
Deterministic top-down tree automata with Boolean deterministic look-ahead. Theor. Comput. Sci. 927: 42-64 (2022)
2010 – 2019
- 2019
- [j55]Sándor Vágvölgyi:
Some decidability results on one-pass reductions. J. Log. Algebraic Methods Program. 105: 47-74 (2019) - 2018
- [j54]Sándor Vágvölgyi:
Intersection of the reflexive transitive closures of two rewrite relations induced by term rewriting systems. Inf. Process. Lett. 134: 47-51 (2018) - [j53]Sándor Vágvölgyi:
Descendants of a recognizable tree language for prefix constrained linear monadic term rewriting with position cutting strategy. Theor. Comput. Sci. 732: 60-72 (2018) - 2017
- [j52]Zoltán Fülöp, Sándor Vágvölgyi:
Minimization of Deterministic Top-down Tree Automata. Acta Cybern. 23(1): 379-401 (2017) - 2016
- [j51]Sándor Vágvölgyi:
One-Pass Reductions. Acta Cybern. 22(3): 633-655 (2016) - 2015
- [j50]Sándor Vágvölgyi:
On Ground Word Problem of Term Equation Systems. Acta Cybern. 22(2): 517-551 (2015) - [j49]Sándor Vágvölgyi:
Symbol different term rewrite systems. J. Log. Algebraic Methods Program. 84(5): 551-575 (2015) - 2014
- [j48]Sándor Vágvölgyi:
Tree shuffle. Theor. Comput. Sci. 521: 8-28 (2014) - 2013
- [j47]Sándor Vágvölgyi:
Recognizing Relations by Tree Automata. J. Autom. Lang. Comb. 18(2): 113-125 (2013) - [j46]Sándor Vágvölgyi:
Rewriting preserving recognizability of finite tree languages. J. Log. Algebraic Methods Program. 82(2): 71-94 (2013) - [i3]Sándor Vágvölgyi:
Threefold Post Correspondence System. CoRR abs/1309.0633 (2013) - 2011
- [j45]Sándor Vágvölgyi:
CHAP and rewrite components. Acta Informatica 48(5-6): 317-361 (2011) - [c8]Xiaoxue Piao, Kai Salomaa, Sándor Vágvölgyi:
Tree Homomorphisms for Unranked Trees. AFL 2011: 343-357 - 2010
- [j44]Sándor Vágvölgyi:
Ground Term Rewriting. Bull. EATCS 102: 153-190 (2010) - [i2]Sándor Vágvölgyi:
Rewriting Preserving Recognizability of Finite Tree Languages. CoRR abs/1006.5516 (2010)
2000 – 2009
- 2009
- [j43]Sándor Vágvölgyi:
Congruences Generated by Extended Ground Term Rewrite Systems. Fundam. Informaticae 95(2-3): 381-399 (2009) - [j42]Sándor Vágvölgyi:
Deterministic bottom-up tree transducers and ground term rewrite systems. Theor. Comput. Sci. 410(21-23): 2250-2278 (2009) - [c7]Sándor Vágvölgyi:
On Ranges of Bottom-up Tree Transducers. Automata, Formal Languages, and Related Topics 2009: 129-143 - [i1]Sándor Vágvölgyi:
On ground word problem of term equation systems. CoRR abs/0902.4348 (2009) - 2008
- [j41]Sándor Vágvölgyi:
Murg term rewrite systems. Inf. Process. Lett. 108(5): 264-272 (2008) - 2007
- [j40]Sándor Vágvölgyi:
Losing recognizability. Theor. Comput. Sci. 379(1-2): 298-304 (2007) - 2006
- [j39]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
- [j38]Sándor Vágvölgyi:
Left-linear Right-ground Term Rewrite Systems and Ground Term Rewrite Systems. Bull. EATCS 82: 269-285 (2004) - [j37]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
- [j36]Sándor Vágvölgyi:
Intersection of finitely generated congruences over term algebra. Theor. Comput. Sci. 300(1-3): 209-234 (2003) - [j35]Sándor Vágvölgyi:
Term rewriting restricted to ground terms. Theor. Comput. Sci. 302(1-3): 135-165 (2003) - [j34]Sándor Vágvölgyi:
On ground tree transformations and congruences induced by tree automata. Theor. Comput. Sci. 304(1-3): 449-459 (2003) - [j33]Sándor Vágvölgyi:
Right-linear half-monadic term rewrite systems. Theor. Comput. Sci. 309(1-3): 195-211 (2003) - 2002
- [j32]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
- [j31]János Apró, Sándor Vágvölgyi:
The Ground Tree Transducer Game with Identical Tree Automata. Fundam. Informaticae 45(3): 157-172 (2001) - [j30]Zoltán Fülöp, Sándor Vágvölgyi:
Restricted ground tree transducers. Theor. Comput. Sci. 250(1-2): 219-233 (2001) - [c6]Cezar Câmpeanu, Kai Salomaa, Sándor Vágvölgyi:
Shuffle Quotient and Decompositions. Developments in Language Theory 2001: 186-196 - 2000
- [j29]Sándor Vágvölgyi:
Intersection of Finitely Generated Congruences over the Term Algebra with Equal Trunks. Bull. EATCS 71: 167-187 (2000) - [j28]Sándor Vágvölgyi:
Congruential complements of ground term rewrite systems. Theor. Comput. Sci. 238(1-2): 247-274 (2000) - [j27]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)
1990 – 1999
- 1999
- [j26]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
- [j25]Sándor Vágvölgyi:
The Ground Tree Transducer Game. Fundam. Informaticae 34(1-2): 175-201 (1998) - [j24]Sándor Vágvölgyi:
Simple and Minimal Ground Term Equation Systems. Fundam. Informaticae 36(4): 367-413 (1998) - [j23]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) - [c5]Zoltán Fülöp, Eija Jurvanen, Magnus Steinby, Sándor Vágvölgyi:
On One-Pass Term Rewriting. MFCS 1998: 248-256 - 1997
- [j22]Zoltán Fülöp, Sándor Vágvölgyi:
Minimal Equational Representations of Recognizable Tree Languages. Acta Informatica 34(1): 59-84 (1997) - 1996
- [j21]Giora Slutzki, Sándor Vágvölgyi:
A Hierarchy of Deterministic Top-Down Tree Transformations. Math. Syst. Theory 29(2): 169-188 (1996) - [j20]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
- [j19]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) - [j18]Giora Slutzki, Sándor Vágvölgyi:
Deterministic Top-Down Tree Transducers with Iterated Lookahead. Theor. Comput. Sci. 143(2): 285-308 (1995) - 1994
- [j17]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
- [j16]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) - [j15]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) - [c4]Giora Slutzki, Sándor Vágvölgyi:
A Hierarchy of Deterministic Top-down Tree Transformations. FCT 1993: 440-451 - 1992
- [j14]Sándor Vágvölgyi, Rémi Gilleron:
For a rewrite system it is decidable whether the set of irreducible, ground terms is regognizable. Bull. EATCS 48: 197-209 (1992) - [j13]Sándor Vágvölgyi:
Top-Down Tree Transducers with Two-Way Tree Walking Look-Ahead. Theor. Comput. Sci. 93(1): 43-74 (1992) - [p1]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 - 1991
- [j12]Zoltán Fülöp, Sándor Vágvölgyi:
Ground Term Rewriting Rules for the Word Problem of Ground Term Equations. Bull. EATCS 45: 186-201 (1991) - [j11]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) - [c3]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 - 1990
- [j10]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) - [j9]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)
1980 – 1989
- 1989
- [j8]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. Bull. EATCS 39: 175-184 (1989) - [j7]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) - [j6]Zoltán Fülöp, Sándor Vágvölgyi:
Variants of Top-Down Tree Transducers With Look-Ahead. Math. Syst. Theory 21(3): 125-145 (1989) - [c2]Zoltán Fülöp, Sándor Vágvölgyi:
Iterated Deterministic Top-Down Look-Ahead. FCT 1989: 175-184 - 1988
- [j5]Sándor Vágvölgyi, Zoltán Fülöp:
On ranges of compositions of deterministic root-to-frontier tree transformations. Acta Cybern. 8(3): 259-266 (1988) - [j4]Zoltán Fülöp, Sándor Vágvölgyi:
On domains of tree tranducers. Bull. EATCS 34: 55-61 (1988) - [c1]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 - 1987
- [j3]Zoltán Fülöp, Sándor Vágvölgyi:
Results on compositions of deterministic root-to-frontier tree transformations. Acta Cybern. 8(1): 49-61 (1987) - [j2]Sándor Vágvölgyi, Zoltán Fülöp:
An infinite hierarchy of tree transformations in the class NDR. Acta Cybern. 8(2): 153-168 (1987) - 1986
- [j1]Sándor Vágvölgyi:
On compositions of root-to-frontier tree transformations. Acta Cybern. 7(4): 443-480 (1986)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2025-01-21 00:14 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
