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