Search    Browse

The FacetedDBLP logo    Search for: in:

Disable automatic phrases ?     Syntactic query expansion: ?

Publications of "Sándor Vágvölgyi" ( http://dblp.L3S.de/Authors/Sándor_Vágvölgyi )

URL (Homepage):  http://www.inf.u-szeged.hu/~vagvolgy/  Author page on DBLP  Author page in RDF  Community of Sándor Vágvölgyi in ASPL-2

Publication years (Num. hits)
1986-1991 (15) 1992-1998 (16) 1999-2006 (15) 2007-2011 (10)
Publication types (Num. hits)
article(47) incollection(1) inproceedings(8)
Venues (Conferences, Journals, ...)
Theor. Comput. Sci.(18) Bulletin of the EATCS(7) Acta Cybern.(5) Fundam. Inform.(4) Inf. Process. Lett.(4) Acta Inf.(2) CoRR(2) FCT(2) Inf. Comput.(2) Mathematical Systems Theory(2) AFL(1) ALP(1) Automata, Formal Languages, an...(1) Developments in Language Theor...(1) Int. J. Found. Comput. Sci.(1) MFCS(1) More (+10 of total 18)
Authors
Sándor Vágvölgyi(56) Zoltán Fülöp(20) Giora Slutzki(3) Kai Salomaa(3) Pál Gyenizse(3) Rémi Gilleron(3) Cezar Câmpeanu(2) Eija Jurvanen(2) Jean-Luc Coquidé(2) Magnus Steinby(2) Max Dauchet(2) Frank Herrmann(1) Heiko Vogler(1) János Apró(1) Tamás Hornung(1) Xiaoxue Piao(1)
GrowBag graphs for keyword ? (Num. hits/coverage)

Group by:
No Growbag Graphs found.
Results
Found 56 publication records. Showing 56 according to the selection in the facets
Hits ?▲ Authors Title Venue Year Link Author keywords
1Sándor Vágvölgyi CHAP and rewrite components. Search on Bibsonomy Acta Inf. The full citation details ... 2011 DBLP  DOI  BibTeX  RDF
1Xiaoxue Piao, Kai Salomaa, Sándor Vágvölgyi Tree Homomorphisms for Unranked Trees. Search on Bibsonomy AFL The full citation details ... 2011 DBLP  BibTeX  RDF
1Sándor Vágvölgyi Rewriting Preserving Recognizability of Finite Tree Languages Search on Bibsonomy CoRR The full citation details ... 2010 DBLP  BibTeX  RDF
1Sándor Vágvölgyi Ground Term Rewriting. Search on Bibsonomy Bulletin of the EATCS The full citation details ... 2010 DBLP  BibTeX  RDF
1Sándor Vágvölgyi Deterministic bottom-up tree transducers and ground term rewrite systems. Search on Bibsonomy Theor. Comput. Sci. The full citation details ... 2009 DBLP  DOI  BibTeX  RDF
1Sándor Vágvölgyi Congruences Generated by Extended Ground Term Rewrite Systems. Search on Bibsonomy Fundam. Inform. The full citation details ... 2009 DBLP  DOI  BibTeX  RDF
1Sándor Vágvölgyi On ground word problem of term equation systems Search on Bibsonomy CoRR The full citation details ... 2009 DBLP  BibTeX  RDF
1Sándor Vágvölgyi On Ranges of Bottom-up Tree Transducers. Search on Bibsonomy Automata, Formal Languages, and Related Topics The full citation details ... 2009 DBLP  BibTeX  RDF
1Sándor Vágvölgyi Murg term rewrite systems. Search on Bibsonomy Inf. Process. Lett. The full citation details ... 2008 DBLP  DOI  BibTeX  RDF
1Sándor Vágvölgyi Losing recognizability. Search on Bibsonomy Theor. Comput. Sci. The full citation details ... 2007 DBLP  DOI  BibTeX  RDF
1Sándor Vágvölgyi Descendants of a recognizable tree language for sets of linear monadic term rewrite rules. Search on Bibsonomy Inf. Process. Lett. The full citation details ... 2006 DBLP  DOI  BibTeX  RDF
1Tamás Hornung, Sándor Vágvölgyi Storage-to-tree transducers with look-ahead. Search on Bibsonomy Theor. Comput. Sci. The full citation details ... 2004 DBLP  DOI  BibTeX  RDF
1Sándor Vágvölgyi Left-linear Right-ground Term Rewrite Systems and Ground Term Rewrite Systems. Search on Bibsonomy Bulletin of the EATCS The full citation details ... 2004 DBLP  BibTeX  RDF
1Sándor Vágvölgyi Right-linear half-monadic term rewrite systems. Search on Bibsonomy Theor. Comput. Sci. The full citation details ... 2003 DBLP  DOI  BibTeX  RDF
1Sándor Vágvölgyi Term rewriting restricted to ground terms. Search on Bibsonomy Theor. Comput. Sci. The full citation details ... 2003 DBLP  DOI  BibTeX  RDF
1Sándor Vágvölgyi On ground tree transformations and congruences induced by tree automata. Search on Bibsonomy Theor. Comput. Sci. The full citation details ... 2003 DBLP  DOI  BibTeX  RDF
1Sándor Vágvölgyi Intersection of finitely generated congruences over term algebra. Search on Bibsonomy Theor. Comput. Sci. The full citation details ... 2003 DBLP  DOI  BibTeX  RDF
1Cezar Câmpeanu, Kai Salomaa, Sándor Vágvölgyi Shuffle Decompositions of Regular Languages. Search on Bibsonomy Int. J. Found. Comput. Sci. The full citation details ... 2002 DBLP  DOI  BibTeX  RDF
1Zoltán Fülöp, Sándor Vágvölgyi Restricted ground tree transducers. Search on Bibsonomy Theor. Comput. Sci. The full citation details ... 2001 DBLP  DOI  BibTeX  RDF
1János Apró, Sándor Vágvölgyi The Ground Tree Transducer Game with Identical Tree Automata. Search on Bibsonomy Fundam. Inform. The full citation details ... 2001 DBLP  BibTeX  RDF
1Cezar Câmpeanu, Kai Salomaa, Sándor Vágvölgyi Shuffle Quotient and Decompositions. Search on Bibsonomy Developments in Language Theory The full citation details ... 2001 DBLP  DOI  BibTeX  RDF
1Pál Gyenizse, Sándor Vágvölgyi A property of left-linear rewrite systems preserving recognizability. Search on Bibsonomy Theor. Comput. Sci. The full citation details ... 2000 DBLP  DOI  BibTeX  RDF
1Sándor Vágvölgyi Congruential complements of ground term rewrite systems. Search on Bibsonomy Theor. Comput. Sci. The full citation details ... 2000 DBLP  DOI  BibTeX  RDF
1Sándor Vágvölgyi Intersection of Finitely Generated Congruences over the Term Algebra with Equal Trunks. Search on Bibsonomy Bulletin of the EATCS The full citation details ... 2000 DBLP  BibTeX  RDF
1Zoltán Fülöp, Eija Jurvanen, Magnus Steinby, Sándor Vágvölgyi On One-Pass Term Rewriting. Search on Bibsonomy Acta Cybern. The full citation details ... 1999 DBLP  BibTeX  RDF
1Pál Gyenizse, Sándor Vágvölgyi Linear Generalized Semi-Monadic Rewrite Systems Effectively Preserve Recognizability. Search on Bibsonomy Theor. Comput. Sci. The full citation details ... 1998 DBLP  DOI  BibTeX  RDF
1Sándor Vágvölgyi The Ground Tree Transducer Game. Search on Bibsonomy Fundam. Inform. The full citation details ... 1998 DBLP  DOI  BibTeX  RDF
1Sándor Vágvölgyi Simple and Minimal Ground Term Equation Systems. Search on Bibsonomy Fundam. Inform. The full citation details ... 1998 DBLP  DOI  BibTeX  RDF
1Zoltán Fülöp, Eija Jurvanen, Magnus Steinby, Sándor Vágvölgyi On One-Pass Term Rewriting. Search on Bibsonomy MFCS The full citation details ... 1998 DBLP  DOI  BibTeX  RDF
1Zoltán Fülöp, Sándor Vágvölgyi Minimal Equational Representations of Recognizable Tree Languages. Search on Bibsonomy Acta Inf. The full citation details ... 1997 DBLP  DOI  BibTeX  RDF
1Pál Gyenizse, Sándor Vágvölgyi Compositions of Deterministic Bottom-Up, Top-Down, and Regular Look-Ahead Tree Transformations. Search on Bibsonomy Theor. Comput. Sci. The full citation details ... 1996 DBLP  DOI  BibTeX  RDF
1Giora Slutzki, Sándor Vágvölgyi A Hierarchy of Deterministic Top-Down Tree Transformations. Search on Bibsonomy Mathematical Systems Theory The full citation details ... 1996 DBLP  BibTeX  RDF
1Giora Slutzki, Sándor Vágvölgyi Deterministic Top-Down Tree Transducers with Iterated Lookahead. Search on Bibsonomy Theor. Comput. Sci. The full citation details ... 1995 DBLP  DOI  BibTeX  RDF
1Zoltán Fülöp, Sándor Vágvölgyi Attributed Tree Transducers Cannot Induce all Deterministic Bottom-Up Tree Transformations Search on Bibsonomy Inf. Comput. The full citation details ... 1995 DBLP  DOI  BibTeX  RDF
1Jean-Luc Coquidé, Max Dauchet, Rémi Gilleron, Sándor Vágvölgyi Bottom-Up Tree Pushdown Automata: Classification and Connection with Rewrite Systems. Search on Bibsonomy Theor. Comput. Sci. The full citation details ... 1994 DBLP  DOI  BibTeX  RDF
1Zoltán Fülöp, Frank Herrmann, Sándor Vágvölgyi, Heiko Vogler Tree Transducers with External Functions. Search on Bibsonomy Theor. Comput. Sci. The full citation details ... 1993 DBLP  DOI  BibTeX  RDF
1Sándor Vágvölgyi A Fast Algorithm for Constructing a Tree Automaton Recognizing a Congruential Tree Language. Search on Bibsonomy Theor. Comput. Sci. The full citation details ... 1993 DBLP  DOI  BibTeX  RDF
1Giora Slutzki, Sándor Vágvölgyi A Hierarchy of Deterministic Top-down Tree Transformations. Search on Bibsonomy FCT The full citation details ... 1993 DBLP  DOI  BibTeX  RDF
1Sándor Vágvölgyi Top-Down Tree Transducers with Two-Way Tree Walking Look-Ahead. Search on Bibsonomy Theor. Comput. Sci. The full citation details ... 1992 DBLP  DOI  BibTeX  RDF
1Sándor Vágvölgyi, Rémi Gilleron For a rewrite system it is decidable whether the set of irreducible, ground terms is regognizable. Search on Bibsonomy Bulletin of the EATCS The full citation details ... 1992 DBLP  BibTeX  RDF
1Zoltán Fülöp, Sándor Vágvölgyi Decidability of the inclusion in monoids generated by tree transformation classes. Search on Bibsonomy Tree Automata and Languages The full citation details ... 1992 DBLP  BibTeX  RDF
1Zoltán Fülöp, Sándor Vágvölgyi A Complete Classification of Deterministic Root-To-Frontier Tree Transformation Classes. Search on Bibsonomy Theor. Comput. Sci. The full citation details ... 1991 DBLP  DOI  BibTeX  RDF
1Zoltán Fülöp, Sándor Vágvölgyi Ground Term Rewriting Rules for the Word Problem of Ground Term Equations. Search on Bibsonomy Bulletin of the EATCS The full citation details ... 1991 DBLP  BibTeX  RDF
1Jean-Luc Coquidé, Max Dauchet, Rémi Gilleron, Sándor Vágvölgyi Bottom-Up Tree Pushdown Automata and Rewrite Systems. Search on Bibsonomy RTA The full citation details ... 1991 DBLP  DOI  BibTeX  RDF Rewrite systems (=term rewrite systems), Church-Rosser (=confluent) systems, Noetherian systems, Convergent (=noetherian+confluent) systems, (Deterministic) tree automaton with pushdown store, (Recognizable, Context-free) tree languages
1Zoltán Fülöp, Sándor Vágvölgyi The Emptiness Problem is Undecidable for Domains of Partial Monadic 2-Modular Tree Transformations. Search on Bibsonomy Inf. Process. Lett. The full citation details ... 1990 DBLP  DOI  BibTeX  RDF
1Zoltán Fülöp, Sándor Vágvölgyi A Complete Rewriting System for a Monoid of Tree Transformation Classes Search on Bibsonomy Inf. Comput. The full citation details ... 1990 DBLP  DOI  BibTeX  RDF
1Zoltán Fülöp, Sándor Vágvölgyi Top-Down Tree Transducers with Deterministic Top-Down Look-Ahead. Search on Bibsonomy Inf. Process. Lett. The full citation details ... 1989 DBLP  DOI  BibTeX  RDF
1Zoltá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. Search on Bibsonomy Bulletin of the EATCS The full citation details ... 1989 DBLP  BibTeX  RDF
1Zoltán Fülöp, Sándor Vágvölgyi Variants of Top-Down Tree Transducers With Look-Ahead. Search on Bibsonomy Mathematical Systems Theory The full citation details ... 1989 DBLP  DOI  BibTeX  RDF
1Zoltán Fülöp, Sándor Vágvölgyi Iterated Deterministic Top-Down Look-Ahead. Search on Bibsonomy FCT The full citation details ... 1989 DBLP  BibTeX  RDF
1Sándor Vágvölgyi, Zoltán Fülöp On ranges of compositions of deterministic root-to-frontier tree transformations. Search on Bibsonomy Acta Cybern. The full citation details ... 1988 DBLP  BibTeX  RDF
1Zoltán Fülöp, Sándor Vágvölgyi On domains of tree tranducers. Search on Bibsonomy Bulletin of the EATCS The full citation details ... 1988 DBLP  BibTeX  RDF
1Zoltán Fülöp, Sándor Vágvölgyi A Characterization of Irreducible Sets Modulo Left-Linear Term Rewriting Systems by Tree Automata. Search on Bibsonomy ALP The full citation details ... 1988 DBLP  DOI  BibTeX  RDF
1Sándor Vágvölgyi, Zoltán Fülöp An infinite hierarchy of tree transformations in the cals NDR. Search on Bibsonomy Acta Cybern. The full citation details ... 1987 DBLP  BibTeX  RDF
1Zoltán Fülöp, Sándor Vágvölgyi Results on compositions of deterministic root-to-frontier tree transformations. Search on Bibsonomy Acta Cybern. The full citation details ... 1987 DBLP  BibTeX  RDF
1Sándor Vágvölgyi On the compositions of root-to-frontier tree tranformations. Search on Bibsonomy Acta Cybern. The full citation details ... 1986 DBLP  BibTeX  RDF
Displaying result #1 - #56 of 56 (100 per page; Change: )
Valid XHTML 1.1! Valid CSS! [Valid RSS]
Maintained by Jörg Diederich.
Based upon DBLP by Michael Ley.