Ferenc Gécseg - researchr alias

researchr

You are not signed in
Sign in
Sign up

Viewing Publication 1 - 36 from 36

2011

Classes of Tree Languages and DR Tree Languages Given by Classes of SemigroupsFerenc Gécseg. actaC, 20(2):253-267, 2011. [doi]

2007

Classes of Tree Languages Determined by Classes of MonoidsFerenc Gécseg. ijfcs, 18(6):1237-1246, 2007. [doi]

2006

On the closedness of nilpotent DR tree languages under Boolean operationsFerenc Gécseg, György Gyurica. actaC, 17(3):449-457, 2006. [doi]

On Asynchronous Tree AutomataFerenc Gécseg, Balázs Imreh. jalc, 11(2):161-168, 2006.

2004

On Definite and Nilpotent DR Tree LanguagesFerenc Gécseg, Balázs Imreh. jalc, 9(1):55-60, 2004.

2003

Comments on Complete Sets of Tree AutomataFerenc Gécseg. dlt 2003: 22-34 [doi]

2002

On Quasi-Products of Tree AutomataFerenc Gécseg. jucs, 8(2):184-192, 2002. [doi]

On Monotone Automata and Monotone LanguagesFerenc Gécseg, Balázs Imreh. jalc, 7(1):71-82, 2002.

2001

On Isomorphic Representations of Monotone Tree and Nondeterministic Tree Ferenc Gécseg, Balázs Imreh. BIRTHDAY 2001: 141-154

On isomorphic representations of generalized definite automataFerenc Gécseg, Balázs Imreh. actaC, 15(1):33-44, 2001. [doi]

Minimal Recognizers and Syntactic Monoids of DR Tree LanguagesFerenc Gécseg, Magnus Steinby. BIRTHDAY 2001: 155-167

1998

On the Existence of Finite Isomorphically Complete Systems of AutomataFerenc Gécseg, Balázs Imreh, András Pluhár. jalc, 3(2):77-84, 1998.

1997

On complete sets of tree automataFerenc Gécseg, Balázs Imreh. dlt 1997: 37-47

1996

Dependence in AlgebrasFerenc Gécseg, Helmut Jürgensen. FUIN, 25(3):247-256, 1996.

1994

Homomorphic Representations by Producs of Tree AutomataFerenc Gécseg. BIRTHDAY 1994: 131-139

1992

Finite isomorphically complete systemsFerenc Gécseg, Balázs Imreh. DAM, 36(3):307-311, 1992. [doi]

1991

On alpha-0-nu-1-Products of AutomataFerenc Gécseg, Helmut Jürgensen. TCS, 80(1):35-51, 1991.

1990

Automata Represented by Products of Soliton AutomataFerenc Gécseg, Helmut Jürgensen. TCS, 74(2):163-181, 1990.

1989

On star-product of automataFerenc Gécseg, Balázs Imreh. actaC, 9(2):167-172, 1989.

1987

On isomorphic metric equivalence of nu:::i:::Ferenc Gécseg, Balázs Imreh. actaC, 8:129-134, 1987.

On a Representation of Tree AutomataZoltán Ésik, Ferenc Gécseg. TCS, 53:243-255, 1987.

1986

Products of AutomataFerenc Gécseg. Volume 7 of EATCS Monographs on Theoretical Computer Science, Springer, 1986. [doi]

On alpha-0-Products and alpha-2-ProductsZoltán Ésik, Ferenc Gécseg. TCS, 48(3):1-8, 1986.

Homomorphic Realizations of Automata with CompositionsZoltán Ésik, Pál Dömösi, Ferenc Gécseg, J. Virágh. mfcs 1986: 299-307

1985

On nv:::i:::-products of commutative automataFerenc Gécseg. actaC, 7(1):55-59, 1985.

Metric representations by nu:::i:::-productsFerenc Gécseg. actaC, 7(2):203-209, 1985.

1984

On a representation of deterministic uniform foot-to frontier tree transformationsFerenc Gécseg. actaC, 6:173-180, 1984.

Tree AutomataFerenc Gécseg, Magnus Steinby. Akadéniai Kiadó, Budapest, Hungary, 1984.

General products and equational classes of automataZoltán Ésik, Ferenc Gécseg. actaC, 6:281-284, 1984.

1980

Minimal ascending tree automataFerenc Gécseg, Magnus Steinby. actaC, 4:37-44, 1980.

1977

Universal Algebras and Tree AutomataFerenc Gécseg. fct 1977: 98-112

Algebra and Logic in Theoretical Computer ScienceFerenc Gécseg, Péter E.-Tóth. mfcs 1977: 78-92

1976

Representation of automaton mappings in finite lengthFerenc Gécseg. actaC, 2:285-289, 1976.

1975

Isomorphic Representation of AutomataFerenc Gécseg. mfcs 1975: 226-230

1974

Composition of AutomataFerenc Gécseg. icalp 1974: 351-363

1973

Model Theoretical Methods in the Theory of AutomataFerenc Gécseg. mfcs 1973: 57-63

Sign in or sign up to see more results.

runs on WebDSL