| [1]-12 | A nonstandard modification of Dempster combination rule. Kramosil, Ivan |
| [13]-44 | Transformations of grammars and translation directed by $LR$ parsing. Melichar, Bořivoj; Bac, Nguyen van |
| [45]-66 | A new practical linear space algorithm for the longest common subsequence problem. Goeman, Heiko; Clausen, Michael |
| [67]-80 | Tuning the Zhu-Takaoka string matching algorithm and experimental results. Berry, Thomas; Ravindran, Somasundaram |
| [81]-90 | Dynamic programming for reduced NFAs for approximate string and sequence matching. Holub, Jan |
| [91]-103 | Implementation of directed acyclic word graph. Balík, Miroslav |
| [105]-111 | The factor automaton. Šimánek, Milan |