G. Dányi

According to our database, G. Dányi authored at least 7 papers between 1990 and 2001.

Collaborative distances:

• Dijkstra number of four.
• Erdős number of three.

2001

The component hierarchy of chain-free cooperating distributed regular tree grammars.

G. Dányi, Zoltán Fülöp

Theor. Comput. Sci., 2001

A component Hierarchy of lambda-, and Chain-free Cooperating Distributed Context Free Grammars.

G. Dányi

Bull. EATCS, 2001

1998

Compositions with Superlinear Deterministic Top-Down Tree Transformations.

G. Dányi, Zoltán Fülöp

Theor. Comput. Sci., 1998

1997

Server Problems and Regular Languages.

Béla Csaba, G. Dányi

Acta Cybern., 1997

1996

Superlinear Deterministic Top-Down Tree Transducers.

G. Dányi, Zoltán Fülöp

Math. Syst. Theory, 1996

A Note on the Equivalence Problem of E-Patterns.

G. Dányi, Zoltán Fülöp

Inf. Process. Lett., 1996

1990

SYS/3 - A Software Development Tool.

János Toczki, Ferenc Kocsis, Tibor Gyimóthy, G. Dányi, Gabriella Kókai

Proceedings of the Compiler Compilers, 1990