Issue contents

Volume 38 (2002)

Issue: 1

Articles

1-12	I. Kramosil	A nonstandard modification of Dempster combination rule
13-44	B. Melichar and N. Bac	Transformations of grammars and translation directed by LR parsing
45-66	H. Goeman and M. Clausen	A new practical linear space algorithm for the longest common subsequence problem
67-80	T. Berry and S. Ravindran	Tuning the Zhu-Takaoka string matching algorithm and experimental results
81-90	J. Holub	Dynamic programming for reduced NFAs for approximate string and sequence matching
91-103	M. Balík	Implementation of directed acyclic word graph
105-111	M. Šimánek	The factor automaton