default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDFerenc Gécseg
Person information
- affiliation: University of Szeged, Hungary
SPARQL queries 
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2010 – 2019
- 2015
[i1]Ferenc Gécseg, Magnus Steinby:
Tree Automata. CoRR abs/1509.06233 (2015)- 2011
- [j24]Ferenc Gécseg:
Classes of Tree Languages and DR Tree Languages Given by Classes of Semigroups. Acta Cybern. 20(2): 253-267 (2011)
2000 – 2009
- 2007
- [j23]Ferenc Gécseg, György Turán:
Kalmár Workshop on Logic and Computer Science - Preface. Acta Cybern. 18(1): 3-5 (2007) - [j22]Ferenc Gécseg:
Classes of Tree Languages Determined by Classes of Monoids. Int. J. Found. Comput. Sci. 18(6): 1237-1246 (2007) - 2006
- [j21]Ferenc Gécseg, György Gyurica:
On the closedness of nilpotent DR tree languages under Boolean operations. Acta Cybern. 17(3): 449-457 (2006) - [j20]Ferenc Gécseg, Balázs Imreh:
On Asynchronous Tree Automata. J. Autom. Lang. Comb. 11(2): 161-168 (2006) - 2004
- [j19]Ferenc Gécseg, Balázs Imreh:
On Definite and Nilpotent DR Tree Languages. J. Autom. Lang. Comb. 9(1): 55-60 (2004) - 2003
- [c11]Ferenc Gécseg:
Comments on Complete Sets of Tree Automata. Developments in Language Theory 2003: 22-34 - 2002
- [j18]Ferenc Gécseg, Balázs Imreh:
On Monotone Automata and Monotone Languages. J. Autom. Lang. Comb. 7(1): 71-82 (2002) - [j17]Ferenc Gécseg:
On Quasi-Products of Tree Automata. J. Univers. Comput. Sci. 8(2): 184-192 (2002) - 2001
- [j16]Ferenc Gécseg, Balázs Imreh:
On isomorphic representations of generalized definite automata. Acta Cybern. 15(1): 33-43 (2001) - [c10]Ferenc Gécseg, Balázs Imreh:
On Isomorphic Representations of Monotone Tree and Nondeterministic Tree . Words, Semigroups, and Transductions 2001: 141-154 - [c9]Ferenc Gécseg, Magnus Steinby:
Minimal Recognizers and Syntactic Monoids of DR Tree Languages. Words, Semigroups, and Transductions 2001: 155-167
1990 – 1999
- 1998
- [j15]Ferenc Gécseg, Balázs Imreh, András Pluhár:
On the Existence of Finite Isomorphically Complete Systems of Automata. J. Autom. Lang. Comb. 3(2): 77-84 (1998) - 1997
- [c8]Ferenc Gécseg, Balázs Imreh:
On complete sets of tree automata. Developments in Language Theory 1997: 37-47 - [p1]Ferenc Gécseg, Magnus Steinby:
Tree Languages. Handbook of Formal Languages (3) 1997: 1-68 - 1996
- [j14]Ferenc Gécseg, Helmut Jürgensen:
Dependence in Algebras. Fundam. Informaticae 25(3): 247-256 (1996) - 1995
- [e3]Zoltán Fülöp, Ferenc Gécseg:
Automata, Languages and Programming, 22nd International Colloquium, ICALP95, Szeged, Hungary, July 10-14, 1995, Proceedings. Lecture Notes in Computer Science 944, Springer 1995, ISBN 3-540-60084-1 [contents] - 1994
- [c7]Ferenc Gécseg:
Homomorphic Representations by Producs of Tree Automata. Results and Trends in Theoretical Computer Science 1994: 131-139 - 1992
- [j13]Ferenc Gécseg, Balázs Imreh:
Finite isomorphically complete systems. Discret. Appl. Math. 36(3): 307-311 (1992) - 1991
- [j12]Ferenc Gécseg, Helmut Jürgensen:
On alpha-0-nu-1-Products of Automata. Theor. Comput. Sci. 80(1): 35-51 (1991) - 1990
- [j11]Ferenc Gécseg, Helmut Jürgensen:
Automata Represented by Products of Soliton Automata. Theor. Comput. Sci. 74(2): 163-181 (1990)
1980 – 1989
- 1989
- [j10]Ferenc Gécseg, Balázs Imreh:
On star-products of automata. Acta Cybern. 9(2): 167-172 (1989) - [e2]János Csirik, János Demetrovics, Ferenc Gécseg:
Fundamentals of Computation Theory, International Conference FCT'89, Szeged, Hungary, August 21-25, 1989, Proceedings. Lecture Notes in Computer Science 380, Springer 1989, ISBN 3-540-51498-8 [contents] - 1987
- [j9]Ferenc Gécseg, Balázs Imreh:
On isomorphic metric equivalence of νi. Acta Cybern. 8(2): 129-134 (1987) - [j8]Zoltán Ésik, Ferenc Gécseg:
On a Representation of Tree Automata. Theor. Comput. Sci. 53: 243-255 (1987) - 1986
- [b2]Ferenc Gécseg:
Products of Automata. EATCS Monographs on Theoretical Computer Science 7, Springer 1986, ISBN 978-3-642-64884-7, pp. I-VIII, 1-107 - [j7]Zoltán Ésik, Ferenc Gécseg:
On alpha-0-Products and alpha-2-Products. Theor. Comput. Sci. 48(3): 1-8 (1986) - [c6]Zoltán Ésik, Pál Dömösi, Ferenc Gécseg, J. Virágh:
Homomorphic Realizations of Automata with Compositions. MFCS 1986: 299-307 - 1985
- [j6]Ferenc Gécseg:
On νi-products of commutative automata. Acta Cybern. 7(1): 55-59 (1985) - [j5]Ferenc Gécseg:
Metric representations by νi-products. Acta Cybern. 7(2): 203-209 (1985) - 1984
- [b1]Ferenc Gécseg, Magnus Steinby:
Tree Automata. Akadéniai Kiadó, Budapest, Hungary 1984, ISBN 963-05-3170-4 - 1983
- [j4]Ferenc Gécseg:
On a representation of deterministic uniform root-to-frontier tree transformations. Acta Cybern. 6(2): 173-180 (1983) - [j3]Zoltán Ésik, Ferenc Gécseg:
General products and equational classes of automata. Acta Cybern. 6(3): 281-284 (1983) - 1981
- [e1]Ferenc Gécseg:
Fundamentals of Computation Theory, FCT'81, Proceedings of the 1981 International FCT-Conference, Szeged, Hungary, August 24-28, 1981. Lecture Notes in Computer Science 117, Springer 1981, ISBN 3-540-10854-8 [contents]
1970 – 1979
- 1978
- [j2]Ferenc Gécseg, Magnus Steinby:
Minimal ascending tree automata. Acta Cybern. 4(1): 37-44 (1978) - 1977
- [c5]Ferenc Gécseg:
Universal Algebras and Tree Automata. FCT 1977: 98-112 - [c4]Ferenc Gécseg, Péter E.-Tóth:
Algebra and Logic in Theoretical Computer Science. MFCS 1977: 78-92 - 1976
- [j1]Ferenc Gécseg:
Representation of automaton mappings in finite length. Acta Cybern. 2(4): 285-289 (1976) - 1975
- [c3]Ferenc Gécseg:
Isomorphic Representation of Automata. MFCS 1975: 226-230 - 1974
- [c2]Ferenc Gécseg:
Composition of Automata. ICALP 1974: 351-363 - 1973
- [c1]Ferenc Gécseg:
Model Theoretical Methods in the Theory of Automata. MFCS 1973: 57-63
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 2024-05-02 20:59 CEST 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:
