Vol. 14 No. 3 (2000)

Regular articles

• A note on decidability of reachability for conditional Petri nets

  Ferucio Laurenţiu Țiplea, Cristina Bădărău

  455-459

  • PDF

• Note on the cardinality of some sets of clones

  Jovanka Pantović, Dušan Vojvodić

  491-495

  • PDF

• On inferring zero-reversible languages

  Erkki Mäkinen

  479-484

  • PDF

• Modular reinforcement learning : a case study in a robot domain

  Zsolt Kalmár, Csaba Szepesvári, András Lőrincz

  507-522

  • PDF

• Unusual algorithms for lexicographical enumeration

  Pál Dömösi

  461-468

  • PDF

• A note on the equivalence of the set covering and process network synthesis problems

  Balázs Imreh, János Fülöp, Ferenc Friedler

  497-502

  • PDF

• Hybrid concurrency control and recovery for multi-level transactions

  Klaus-Dieter Schewe, Torsten Ripke, Sven Drechsler

  419-453

  • PDF

• F codes

  Marek Michalik

  485-489

  • PDF

• Inferring pure context-free languages from positive data

  Takeshi Koshiba, Erkki Mäkinen, Yuji Takada

  469-477

  • PDF

• Note on the work function algorithm

  Béla Csaba

  503-506

  • PDF