Ferenc Gécseg

Publication Activity (10 Years)

Years Active: 1973-2015
Publications (10 Years): 1

Top Topics

Finite Automaton

Syntactic Pattern Recognition

Top Venues

Publications

Ferenc Gécseg, Magnus Steinby
Tree Automata. CoRR (2015)
Ferenc Gécseg
Classes of Tree Languages and DR Tree Languages Given by Classes of Semigroups. Acta Cybern. 20 (2) (2011)
Ferenc Gécseg, György Turán
Kalmár Workshop on Logic and Computer Science - Preface. Acta Cybern. 18 (1) (2007)
Ferenc Gécseg
Classes of Tree Languages Determined by Classes of Monoids. Int. J. Found. Comput. Sci. 18 (6) (2007)
Ferenc Gécseg, György Gyurica
On the closedness of nilpotent DR tree languages under Boolean operations. Acta Cybern. 17 (3) (2006)
Ferenc Gécseg, Balázs Imreh
On Asynchronous Tree Automata. J. Autom. Lang. Comb. 11 (2) (2006)
Ferenc Gécseg, Balázs Imreh
On Definite and Nilpotent DR Tree Languages. J. Autom. Lang. Comb. 9 (1) (2004)
Ferenc Gécseg
Comments on Complete Sets of Tree Automata. Developments in Language Theory (2003)
Ferenc Gécseg
On Quasi-Products of Tree Automata. J. Univers. Comput. Sci. 8 (2) (2002)
Ferenc Gécseg, Balázs Imreh
On Monotone Automata and Monotone Languages. J. Autom. Lang. Comb. 7 (1) (2002)
Ferenc Gécseg, Magnus Steinby
Minimal Recognizers and Syntactic Monoids of DR Tree Languages. Words, Semigroups, and Transductions (2001)
Ferenc Gécseg, Balázs Imreh
On Isomorphic Representations of Monotone Tree and Nondeterministic Tree . Words, Semigroups, and Transductions (2001)
Ferenc Gécseg, Balázs Imreh
On isomorphic representations of generalized definite automata. Acta Cybern. 15 (1) (2001)
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) (1998)
Ferenc Gécseg, Balázs Imreh
On complete sets of tree automata. Developments in Language Theory (1997)
Ferenc Gécseg, Helmut Jürgensen
Dependence in Algebras. Fundam. Informaticae 25 (3) (1996)
Ferenc Gécseg
Homomorphic Representations by Producs of Tree Automata. Results and Trends in Theoretical Computer Science (1994)
Ferenc Gécseg, Balázs Imreh
Finite isomorphically complete systems. Discret. Appl. Math. 36 (3) (1992)
Ferenc Gécseg, Helmut Jürgensen
On alpha-0-nu-1-Products of Automata. Theor. Comput. Sci. 80 (1) (1991)
Ferenc Gécseg, Helmut Jürgensen
Automata Represented by Products of Soliton Automata. Theor. Comput. Sci. 74 (2) (1990)
Ferenc Gécseg, Balázs Imreh
On star-products of automata. Acta Cybern. 9 (2) (1989)
Zoltán Ésik, Ferenc Gécseg
On a Representation of Tree Automata. Theor. Comput. Sci. 53 (1987)
Ferenc Gécseg, Balázs Imreh
. Acta Cybern. 8 (2) (1987)
Zoltán Ésik, Pál Dömösi, Ferenc Gécseg, J. Virágh
Homomorphic Realizations of Automata with Compositions. MFCS (1986)
Zoltán Ésik, Ferenc Gécseg
On alpha-0-Products and alpha-2-Products. Theor. Comput. Sci. 48 (3) (1986)
Ferenc Gécseg
-products of commutative automata. Acta Cybern. 7 (1) (1985)
Ferenc Gécseg
-products. Acta Cybern. 7 (2) (1985)
Zoltán Ésik, Ferenc Gécseg
General products and equational classes of automata. Acta Cybern. 6 (3) (1983)
Ferenc Gécseg
On a representation of deterministic uniform root-to-frontier tree transformations. Acta Cybern. 6 (2) (1983)
Ferenc Gécseg, Magnus Steinby
Minimal ascending tree automata. Acta Cybern. 4 (1) (1978)
Ferenc Gécseg, Péter E.-Tóth
Algebra and Logic in Theoretical Computer Science. MFCS (1977)
Ferenc Gécseg
Universal Algebras and Tree Automata. FCT (1977)
Ferenc Gécseg
Representation of automaton mappings in finite length. Acta Cybern. 2 (4) (1976)
Ferenc Gécseg
Isomorphic Representation of Automata. MFCS (1975)
Ferenc Gécseg
Composition of Automata. ICALP (1974)
Ferenc Gécseg
Model Theoretical Methods in the Theory of Automata. MFCS (1973)