Vol. 15 No. 1 (2001)

Regular articles

• Languages recognized by a class of finite automata

  Andrej V. Kelarev, Olga V. Sokratova

  45-52

  • PDF

• A Chomsky-Schützenberger-Stanley type characterization of the class of slender context-free languages

  Pál Dömösi, Satoshi Okawa

  25-32

  • PDF

• Affine matching of two sets of points in arbitrary dimensions

  Attila Tanács, Gábor Czédli, Kálmán Palágyi, Attila Kuba

  101-106

  • PDF

• On some algebraic properties of automata

  András Ádám

  1-8

  • PDF

• P systems with picture objects

  Shankara Narayanan Krishna, Raghavan Rama, Kamala Krithivasan

  53-74

  • PDF

• On isomorphic representations of generalized definite automata

  Ferenc Gécseg, Balázs Imreh

  33-43

  • PDF

• The complexity of coloring graphs without long induced paths

  Gerhard J. Woeginger, Jiří Sgall

  107-117

  • PDF

• P systems with communication based on concentration

  Jürgen Dassow, Gheorghe Păun

  9-23

  • PDF

• Logical definability of Y-tree and trellis systolic ω-languages

  Monti Angelo, Adriano Peron

  75-100

  • PDF