VOLUME 6 | 2001 | NUMBER 3 |
Mouhamed Kadrie Ahmad, Xavier Augros: | |
Some Results on Codes for Generalized Factorizations | 239–251 |
Klaus Denecke, Jörg Koppitz, Slavcho Shtrakov: | |
The Depth of a Hypersubstitution | 253–262 |
Yannick Guesnet: | |
On Maximal Dense Bifix Codes | 263–273 |
Pierre-Cyrille Héam: | |
Some Topological Properties of Rational Sets | 275–290 |
Costas S. Iliopoulos, R. Jamie Simpson: | |
On-Line Validation and Analysis of Partially Occluded Images | 291–303 |
Andrei Kelarev, Olga Sokratova: | |
Directed Graphs and Syntactic Algebras of Tree Languages | 305–311 |
Rainer Kemp: | |
On the Expected Number of Leftist Nodes in Simply Generated Trees | 313–343 |
Shankara Narayanan Krishna, Raghavan Rama: | |
P Systems with Replicated Rewriting | 345–350 |
Erkki Mäkinen: | |
On the Inclusion Problem for Very Simple Deterministic Pushdown Automata | 351–357 |
Vincenzo Manca, Carlos Martín-Vide, Gheorghe Păun: | |
On the Power of P Systems with Replicated Rewriting | 359–374 |
Friedrich Otto, Nik Ruškuc: | |
Confluent Monadic String-Rewriting Systems and Automatic Structures | 375–388 |