Vol. 14 No. 1 (1999)

Regular articles

• Complete finite automata network graphs with minimal number of edges

  Pál Dömösi, Chrystopher L. Nehaniv

  37-50

  • PDF

• Directable nondeterministic automata

  Balázs Imreh, Magnus Steinby

  105-115

  • PDF

• Watson-Crick walks and roads on DOL graphs

  Arto Salomaa

  179-192

  • PDF

• Two simple algorithms for bin covering

  János Csirik

  13-25

  • PDF

• On one-pass term rewriting

  Zoltán Fülöp

  83-98

  • PDF

• Duplication grammars

  Carlos Martín-Vide, Gheorghe Păun

  151-164

  • PDF

• Preface

  János Csirik

  • PDF

• Trips on trees

  Joost Engelfriet, Hendrik Jan Hoogeboom, Jan-Pascal Van Best

  51-64

  • PDF

• Syntactic monoids of codes

  Helmut Jürgensen

  117-133

  • PDF

• Generalized fairness and context-free languages

  Kai Salomaa, Sheng Yu

  193-203

  • PDF

• On ±l-representations of integers

  János Demetrovics, Attila Pethő, Lajos Rónyai

  27-36

  • PDF

• A note on the star-product

  Balázs Imreh, Masami Ito

  99-104

  • PDF

• Some properties of duplication grammars

  Victor Mitrana, Grzegorz Rozenberg

  165-177

  • PDF

• On some cyclic connectivity properties of directed graphs : examples and problems

  András Ádám

  1-12

  • PDF

• Axiomatizing iteration categories

  Zoltán Ésik

  65-82

  • PDF

• Tree transducers and formal tree series

  Werner Kuich

  135-145

  • PDF