Abstract is missing.
- Tree Languages Recognizable by Regular Frontier CheckEija Jurvanen, Andreas Potthoff, Wolfgang Thomas. 3-17
- Deciding Multiplicity Equivalence for Certain Context-free LanguagesDanny Raz. 18-29
- Compositions of CodingsDenis Derencourt, Alain Terlutte. 30-43
- Iteration Conditions of W. Ogden s Type and Applications to Programming Languages (II)Dragos Vaida. 44-50
- Substitution on Words and LanguagesAdrian Atanasiu, Victor Mitrana. 51-59
- On the Index of Pure Context-free Grammars and LanguagesGianina Georgescu. 60-69
- A Note on the Degree of NondeterminismHenning Bordihn, Jürgen Dassow. 70-80
- Remarks on Adult Languages of Propagating Systems with Restricted ParallelismHenning Fernau. 90-101
- Productions in Stable OL-SystemsAlica Kelemenová, Peter Vajgel. 102-110
- Borel Normality and Algorithmic RandomnessCristian Calude. 113-129
- Repetitions in Kolakoski SequenceArto Lepistö. 130-143
- Morphic Images of Gauss CodesJarkko Kari, Valtteri Niemi. 144-156
- Iterative Reading of Numbers: The Ordered CaseJürgen Dassow, Solomon Marcus, Gheorghe Paun. 157-168
- Lindenmayer Systems Generalized to Formal Power Series and Their Growth FunctionsWerner Kuich. 171-178
- On Lindenmayerian Series in Complete SemiringsJuha Honkala. 179-192
- Rewriting Extended Regular ExpressionsValentin M. Antimirov, Peter D. Mosses. 195-209
- Local Equational Logic IIVirgil Emil Cazanescu. 210-221
- On the Power of L-Systems in Image GenerationKarel Culik II, Jarkko Kari. 225-236
- Aspects of N-Dimensional Lindenmayer SystemsRudolf Freund. 250-261
- Fractals, Dimension, and Formal LanguagesWolfgang Merzenich, Ludwig Staiger. 262-277
- Generating Self-Affine Fractals by Collage GrammarsFrank Drewes, Annegret Habel, Hans-Jörg Kreowski, Stefan Taubenberger. 278-289
- Two-Dimensional Languages and Recognizable FunctionsDora Giammarresi. 290-301
- Deterministic OL Languages are of Very Low Complexity: DOL is in AC:::0:::Carsten Damm, Markus Holzer, Klaus-Jörn Lange, Peter Rossmanith. 305-313
- Deterministic Versus Nondeterministic Space in Terms of Synchronized Alternating MachinesJuraj Hromkovic, Branislav Rovan, Anna Slobodová. 314-325
- Low-Level Tradeoffs between Reversals and AlternationsKazuo Iwama. 326-341
- Nondeterministic, Probabilistic and Alternating Computations on Cellular Array ModelsKamala Krithivasan, Meena Mahajan. 342-354
- An Introduction to Context-free Text GrammarsAndrzej Ehrenfeucht, Hendrik Jan Hoogeboom, Paulien ten Pas, Grzegorz Rozenberg. 357-369
- Contextual Grammars: Erasing, Determinism, One-Side ContextsGheorghe Paun, Grzegorz Rozenberg, Arto Salomaa. 370-388
- Fair First Languages and Parallel Programme SchemesLuca Breveglieri, Alessandra Cherubini, Claudio Citrini, Stefano Crespi-Reghizzi. 389-418
- On the Power of Communication Structure for Distributive Generation of LanguagesDana Pardubská. 419-429
- Programmed Grammar SystemsValeria Mihalache. 430-437
- Hidden GrammarsSolomon Marcus. 453-460
- General Formal SystemsManfred Kudlek. 461-471
- Algorithmically Coding the UniverseCristian Calude, Arto Salomaa. 472-492