The SCEAS System
Navigation Menu

Search the dblp DataBase

Title:
Author:

Ferenc Gécseg: [Publications] [Author Rank by year] [Co-authors] [Prefers] [Cites] [Cited by]

Publications of Author

  1. Ferenc Gécseg
    Homomorphic Representations by Producs of Tree Automata. [Citation Graph (0, 0)][DBLP]
    Results and Trends in Theoretical Computer Science, 1994, pp:131-139 [Conf]
  2. Ferenc Gécseg, Balázs Imreh
    On Isomorphic Representations of Monotone Tree and Nondeterministic Tree . [Citation Graph (0, 0)][DBLP]
    Words, Semigroups, and Transductions, 2001, pp:141-154 [Conf]
  3. Ferenc Gécseg, Magnus Steinby
    Minimal Recognizers and Syntactic Monoids of DR Tree Languages. [Citation Graph (0, 0)][DBLP]
    Words, Semigroups, and Transductions, 2001, pp:155-167 [Conf]
  4. Ferenc Gécseg
    Comments on Complete Sets of Tree Automata. [Citation Graph (0, 0)][DBLP]
    Developments in Language Theory, 2003, pp:22-34 [Conf]
  5. Ferenc Gécseg
    Universal Algebras and Tree Automata. [Citation Graph (0, 0)][DBLP]
    FCT, 1977, pp:98-112 [Conf]
  6. Ferenc Gécseg
    Composition of Automata. [Citation Graph (0, 0)][DBLP]
    ICALP, 1974, pp:351-363 [Conf]
  7. Zoltán Ésik, Pál Dömösi, Ferenc Gécseg, J. Virágh
    Homomorphic Realizations of Automata with Compositions. [Citation Graph (0, 0)][DBLP]
    MFCS, 1986, pp:299-307 [Conf]
  8. Ferenc Gécseg
    Model Theoretical Methods in the Theory of Automata. [Citation Graph (0, 0)][DBLP]
    MFCS, 1973, pp:57-63 [Conf]
  9. Ferenc Gécseg
    Isomorphic Representation of Automata. [Citation Graph (0, 0)][DBLP]
    MFCS, 1975, pp:226-230 [Conf]
  10. Ferenc Gécseg, Péter E.-Tóth
    Algebra and Logic in Theoretical Computer Science. [Citation Graph (0, 0)][DBLP]
    MFCS, 1977, pp:78-92 [Conf]
  11. Zoltán Ésik, Ferenc Gécseg
    General products and equational classes of automata. [Citation Graph (0, 0)][DBLP]
    Acta Cybern., 1984, v:6, n:, pp:281-284 [Journal]
  12. Ferenc Gécseg
    Representation of automaton mappings in finite length. [Citation Graph (0, 0)][DBLP]
    Acta Cybern., 1976, v:2, n:, pp:285-289 [Journal]
  13. Ferenc Gécseg
    On a representation of deterministic uniform foot-to frontier tree transformations. [Citation Graph (0, 0)][DBLP]
    Acta Cybern., 1984, v:6, n:, pp:173-180 [Journal]
  14. Ferenc Gécseg
    On nvi-products of commutative automata. [Citation Graph (0, 0)][DBLP]
    Acta Cybern., 1985, v:7, n:1, pp:55-59 [Journal]
  15. Ferenc Gécseg
    Metric representations by nui-products. [Citation Graph (0, 0)][DBLP]
    Acta Cybern., 1985, v:7, n:2, pp:203-209 [Journal]
  16. Ferenc Gécseg, György Gyurica
    On the closedness of nilpotent DR tree languages under Boolean operations. [Citation Graph (0, 0)][DBLP]
    Acta Cybern., 2006, v:17, n:3, pp:- [Journal]
  17. Ferenc Gécseg, Balázs Imreh
    On isomorphic representations of generalized definite automata. [Citation Graph (0, 0)][DBLP]
    Acta Cybern., 2001, v:15, n:1, pp:33-44 [Journal]
  18. Ferenc Gécseg, Balázs Imreh
    On isomorphic metric equivalence of nui. [Citation Graph (0, 0)][DBLP]
    Acta Cybern., 1987, v:8, n:, pp:129-134 [Journal]
  19. Ferenc Gécseg, Balázs Imreh
    On star-product of automata. [Citation Graph (0, 0)][DBLP]
    Acta Cybern., 1989, v:9, n:2, pp:167-172 [Journal]
  20. Ferenc Gécseg, Magnus Steinby
    Minimal ascending tree automata. [Citation Graph (0, 0)][DBLP]
    Acta Cybern., 1980, v:4, n:, pp:37-44 [Journal]
  21. Ferenc Gécseg, Helmut Jürgensen
    Dependence in Algebras. [Citation Graph (0, 0)][DBLP]
    Fundam. Inform., 1996, v:25, n:3, pp:247-256 [Journal]
  22. Ferenc Gécseg, Balázs Imreh
    On Monotone Automata and Monotone Languages. [Citation Graph (0, 0)][DBLP]
    Journal of Automata, Languages and Combinatorics, 2002, v:7, n:1, pp:71-82 [Journal]
  23. Ferenc Gécseg, Balázs Imreh
    On Definite and Nilpotent DR Tree Languages. [Citation Graph (0, 0)][DBLP]
    Journal of Automata, Languages and Combinatorics, 2004, v:9, n:1, pp:55-60 [Journal]
  24. Ferenc Gécseg, Balázs Imreh, András Pluhár
    On the Existence of Finite Isomorphically Complete Systems of Automata. [Citation Graph (0, 0)][DBLP]
    Journal of Automata, Languages and Combinatorics, 1998, v:3, n:2, pp:77-84 [Journal]
  25. Ferenc Gécseg
    On Quasi-Products of Tree Automata. [Citation Graph (0, 0)][DBLP]
    J. UCS, 2002, v:8, n:2, pp:184-192 [Journal]
  26. Zoltán Ésik, Ferenc Gécseg
    On alpha-0-Products and alpha-2-Products. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 1986, v:48, n:3, pp:1-8 [Journal]
  27. Zoltán Ésik, Ferenc Gécseg
    On a Representation of Tree Automata. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 1987, v:53, n:, pp:243-255 [Journal]
  28. Ferenc Gécseg, Helmut Jürgensen
    Automata Represented by Products of Soliton Automata. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 1990, v:74, n:2, pp:163-181 [Journal]
  29. Ferenc Gécseg, Helmut Jürgensen
    On alpha-0-nu-1-Products of Automata. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 1991, v:80, n:1, pp:35-51 [Journal]

  30. On complete sets of tree automata. [Citation Graph (, )][DBLP]


  31. Kalmár Workshop on Logic and Computer Science --- Preface. [Citation Graph (, )][DBLP]


  32. Finite isomorphically complete systems. [Citation Graph (, )][DBLP]


Search in 0.003secs, Finished in 0.005secs
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