1. On reducing the number of stack symbols in a PDA

   • Jonathan Goldstine
   • John K. Price
   • Detlef Wotschke

   OriginalPaper 22 February 2005 Pages: 313 - 326

2. On the effective generation of set elements within specified ranges

   • Laura A. Sanchis

   OriginalPaper 22 February 2005 Pages: 327 - 341

3. A model of sequential computation with Pipelined access to memory

   • Fabrizio Luccio
   • Linda Pagli

   OriginalPaper 22 February 2005 Pages: 343 - 356

4. Complexity analysis of propositional concurrent programs using domino tiling

   • Hsu -Chun Yen
   • Namhee Pak

   OriginalPaper 22 February 2005 Pages: 357 - 378

5. Concise representations of regular languages by degree and probabilistic finite automata

   • Chandra M. R. Kintala
   • Kong -Yee Pun
   • Detlef Wotschke

   OriginalPaper 22 February 2005 Pages: 379 - 395