Contents of Volume 14, Number 1, 1999

Dedicated to Professor Ferenc Gécseg on the occasion of his 60th birthday

•   A. Ádám : On Some Cyclic Connectivity Properties of Directed Graphs (Examples and Problems) 1.

•   J. Csirik, J.B.G. Frenk, M. Labbé, S. Zhang : Two simple algorithms for bin covering 13.

•   János Demetrovics, Attila Petho, Lajos Rónyai : On $\pm 1$-representations of integers 27.

•   Pál Dömösi, Chrystopher L. Nehaniv : Complete Finite Automata Network Graphs with Minimal Number of Edges 37.

•   Joost Engelfriet, Hendrik Jan Hoogeboom, Jan-Pascal Van Best : Trips on Trees 51.

•   Z. Ésik : Axiomatizing iteration categories 65.

•   Zoltán Fülöp, Eija Jurvanen, Magnus Steinby, Sándor Vágvölgyi : On One-Pass Term Rewriting 83.

•   Balázs Imreh, Masami Ito : A note on the star-product 99.

•   B. Imreh, M. Steinby : Directable nondeterministic automata 105.

•   H. Jürgensen : Syntactic Monoids of Codes 117.

•   Werner Kuich : Tree Transducers and Formal Tree Series 135.

•   Carlos Martín-Vide, Gheorghe Paun : Duplication Grammars 151.

•   Victor Mitrana, Grzegorz Rozenberg : Some Properties of Duplication Grammars 165.

•   Arto Salomaa : Watson-Crick Walks and Roads on DOL Graphs 179.

•   Kai Salomaa, Sheng Yu : Generalized fairness and context-free languages 193.

•  Curriculum Vitae of Ferenc Gécseg 205.

•  List of Publications by Ferenc Gécseg 209.