Model Theoretical Methods in the Theory of Automata. - Ferenc Gécseg (MFCS, 1973)

Composition of Automata. - Ferenc Gécseg (ICALP, 1974)

Isomorphic Representation of Automata. - Ferenc Gécseg (MFCS, 1975)

Representation of automaton mappings in finite length. - Ferenc Gécseg (Acta Cybern., 1976)

Universal Algebras and Tree Automata. - Ferenc Gécseg (FCT, 1977)

Algebra and Logic in Theoretical Computer Science. - Ferenc Gécseg; Péter Ecsedi-Tóth (MFCS, 1977)

Minimal ascending tree automata. - Ferenc Gécseg; Magnus Steinby (Acta Cybern., 1978)

General products and equational classes of automata. - Zoltán Ésik; Ferenc Gécseg (Acta Cybern., 1983)

On a representation of deterministic uniform root-to-frontier tree transformations. - Ferenc Gécseg (Acta Cybern., 1983)

Tree Automata - Ferenc Gécseg; Magnus Steinby (Akadéniai Kiadó, Budapest, Hungary, 1984)

On νi-products of commutative automata. - Ferenc Gécseg (Acta Cybern., 1985)

Metric representations by νi-products. - Ferenc Gécseg (Acta Cybern., 1985)

Homomorphic Realizations of Automata with Compositions. - Zoltán Ésik; Pál Dömösi; Ferenc Gécseg; J. Virágh (MFCS, 1986)

On alpha-0-Products and alpha-2-Products. - Zoltán Ésik; Ferenc Gécseg (Theor. Comput. Sci., 1986)

Products of Automata - Ferenc Gécseg (Springer, 1986)

On isomorphic metric equivalence of νi. - Ferenc Gécseg; Balázs Imreh (Acta Cybern., 1987)

On a Representation of Tree Automata. - Zoltán Ésik; Ferenc Gécseg (Theor. Comput. Sci., 1987)

On star-products of automata. - Ferenc Gécseg; Balázs Imreh (Acta Cybern., 1989)

Automata Represented by Products of Soliton Automata. - Ferenc Gécseg; Helmut Jürgensen (Theor. Comput. Sci., 1990)

On alpha-0-nu-1-Products of Automata. - Ferenc Gécseg; Helmut Jürgensen (Theor. Comput. Sci., 1991)

Finite isomorphically complete systems. - Ferenc Gécseg; Balázs Imreh (Discret. Appl. Math., 1992)

Homomorphic Representations by Producs of Tree Automata. - Ferenc Gécseg (Results and Trends in Theoretical Computer Science, 1994)

Dependence in Algebras. - Ferenc Gécseg; Helmut Jürgensen (Fundam. Informaticae, 1996)

On complete sets of tree automata. - Ferenc Gécseg; Balázs Imreh (Developments in Language Theory, 1997)

Tree Languages. - Ferenc Gécseg; Magnus Steinby (Handbook of Formal Languages (3), 1997)

On the Existence of Finite Isomorphically Complete Systems of Automata. - Ferenc Gécseg; Balázs Imreh; András Pluhár (J. Autom. Lang. Comb., 1998)

On Isomorphic Representations of Monotone Tree and Nondeterministic Tree . - Ferenc Gécseg; Balázs Imreh (Words, Semigroups, and Transductions, 2001)

Minimal Recognizers and Syntactic Monoids of DR Tree Languages. - Ferenc Gécseg; Magnus Steinby (Words, Semigroups, and Transductions, 2001)

On isomorphic representations of generalized definite automata. - Ferenc Gécseg; Balázs Imreh (Acta Cybern., 2001)

On Monotone Automata and Monotone Languages. - Ferenc Gécseg; Balázs Imreh (J. Autom. Lang. Comb., 2002)

On Quasi-Products of Tree Automata. - Ferenc Gécseg (J. Univers. Comput. Sci., 2002)

Comments on Complete Sets of Tree Automata. - Ferenc Gécseg (Developments in Language Theory, 2003)

On Definite and Nilpotent DR Tree Languages. - Ferenc Gécseg; Balázs Imreh (J. Autom. Lang. Comb., 2004)

On the closedness of nilpotent DR tree languages under Boolean operations. - Ferenc Gécseg; György Gyurica (Acta Cybern., 2006)

On Asynchronous Tree Automata. - Ferenc Gécseg; Balázs Imreh (J. Autom. Lang. Comb., 2006)

Kalmár Workshop on Logic and Computer Science - Preface. - Ferenc Gécseg; György Turán (Acta Cybern., 2007)

Classes of Tree Languages Determined by Classes of Monoids. - Ferenc Gécseg (Int. J. Found. Comput. Sci., 2007)

Classes of Tree Languages and DR Tree Languages Given by Classes of Semigroups. - Ferenc Gécseg (Acta Cybern., 2011)

Tree Automata. - Ferenc Gécseg; Magnus Steinby (CoRR, 2015)