Mouhamed Kadrie Ahmad, Xavier Augros:
Some Results on Codes for Generalized Factorizations239–251
Klaus Denecke, Jörg Koppitz, Slavcho Shtrakov:
The Depth of a Hypersubstitution253–262
Yannick Guesnet:
On Maximal Dense Bifix Codes263–273
Pierre-Cyrille Héam:
Some Topological Properties of Rational Sets275–290
Costas S. Iliopoulos, R. Jamie Simpson:
On-Line Validation and Analysis of Partially Occluded Images291–303
Andrei Kelarev, Olga Sokratova:
Directed Graphs and Syntactic Algebras of Tree Languages305–311
Rainer Kemp:
On the Expected Number of Leftist Nodes in Simply Generated Trees313–343
Shankara Narayanan Krishna, Raghavan Rama:
P Systems with Replicated Rewriting345–350
Erkki Mäkinen:
On the Inclusion Problem for Very Simple Deterministic Pushdown Automata351–357
Vincenzo Manca, Carlos Martín-Vide, Gheorghe Păun:
On the Power of P Systems with Replicated Rewriting359–374
Friedrich Otto, Nik Ruškuc:
Confluent Monadic String-Rewriting Systems and Automatic Structures375–388