Preface

Invited Lectures

Special factors in some combinatorial structures A. Carpi, A. de Luca, S. Varricchio

Subword complexity and periodicity in two or more dimensions
J.	Cassaigne

On the decomposition of finite languages
A.	Salomaa, Sh. Yu

Computation = self-assembly + conformational change: Toward new computing paradigms
T Yokomori

Contributed Papers

l.	Automata and Languages

Asynchronous sliding block maps
M.-P. Béal, 0. Carton

Bisimulations and behaviour of nondeterministic automata C.S. Calude, E. Calude

Deterministic forgetting planar automata are more powerful than nondeterministic finite-state planar automata
P.	Jiricka J. Kràl

Functions preserving classes of languages
P.	Kveton V Koubek

Restarting automata, Church-Rosser languages, and representations of r.e. languages

G.	Niemann, F Otto

Weak cyclic forms of rw automata
M.	PIàtek
Exponential ambiguity of context-free grammars K Wich

Codes, Combinatorics of Words, and Algebraic Methods

A non-ambiguous language factorization problem
M.	Anselmo

Decidability of code properties
H.	Fernau, K Reinhardt L. Staiger

Defect theorems for trees
J.	Karhumäki S. Mantaci

On the complexity of computing the order of repetition of a string J. Karhumäki, W Plandowski, W Rytter
New problems of pattern avoidance	1
J.	Loftus, J. Shallit, M. - W Wang
Substitutions from Rauzy induction	2
L.	-M. Lopez, P Narbel
Characterization of a word by its subwords	2
J.	Manuch
On semilinearity in formal power series	2
l.	Petre
Right and left strongly testable semigroups and languages	2
J.	Ruiz, P. Garcia

Applications in Data Base Theory and Parsing
On decidability of boundedness property for regular path queries	24
Y André F Bossut, A-C. Caron
3idirectional parsing for linear languages	25
¶j. ,Andrei, M. Kudlek
Caterpillars, context, tree automata, and tree pattern matching	27
A.	Brüggemann-Klein D. Wood
YakYak:	Parsing with logical side constraints N. KIarlund, N. Dam gaard, M.I. Schwa rtzbach

Generalized Models of Grammars and Computation

Cooperating distributed grammar systems with non-terminating components
H.	Bordihn, M. Holzer

On tally languages and generalized interacting automata T Buchholz, ,A Klein, M. Kutrib

Table-driven and context-sensitive collage languages
F Drewes, R. Klempien-Hinrichs, H. -J. Kreowski

Test tube systems: When two tubes are enough
R.	Freund, F Freund

On fixed and general membership for external and internal contextual languages
M.	Holzer

Contextual grammars with trajectories
C.	Martin-Vide, ,A• Mateescu

Slender matrix languages
R.	Stiebe