Abstract is missing.
- The games of his lifeSolomon Marcus. 1-10
- Deterministic stream X-machines based on grammar systemsTudor Balanescu, Marian Gheorghe, Mike Holcombe. 13-23
- Some ghosts that arise in a spliced linguistic string: evidence from catalanGemma Bel Enguix. 25-35
- On size complexity of context-free returning parallel communicating grammar systemsErzsébet Csuhaj-Varjú. 37-49
- Subregularly controlled derivations: restrictions by syntactic parametersJürgen Dassow. 51-61
- Neo-modularity and coloniesJozef Kelemen, Alica Kelemenová, Victor Mitrana. 63-74
- Sewing contexts and mildly context-sensitive languagesCarlos Martín-Vide, Alexandru Mateescu, Arto Salomaa. 75-84
- Towards grammars of decision algorithmsLech Polkowski, Andrzej Skowron. 85-95
- Computational complementarity for probabilistic automataCristian S. Calude, Elena Calude, Karl Svozil. 99-113
- Acceptance of omega-languages by communicating deterministic turing machingRudolf Freund, Ludwig Staiger. 115-126
- Counter machines and the safety and disjointness problems for database queries with linear constraintsOscar H. Ibarra, Jianwen Su, Constantinos Bartzis. 127-137
- Automata arrays and context-free languagesMartin Kutrib. 139-148
- On special forms of restarting automataFrantisek Mráz, Martin Plátek, Martin Procházka. 149-160
- The time dimension of computation modelsSheng Yu. 161-172
- An infinite sequence of full AFL-structures, each of which possesses an infinite hierarchyPeter R. J. Asveld. 175-186
- Trellis languagesAdrian Atanasiu. 187-198
- Pictures, layers, double stranded molecules: on multi-dimenional sentencesPaolo Bottoni. 199-209
- Transduction in polypodesSymeon Bozapalidis. 211-218
- Some algebraic properties of contexts and their applications to contextual languagesRodica Ceterchi. 219-226
- On Fatou properties of rational languagesChristian Choffrut, Juhani Karhumäki. 227-235
- Multiple keyword patterns in context-free languagesPál Dömösi, Masami Ito. 237-241
- Reading words in graphs generated by hyperedge replacementFrank Drewes, Hans-Jörg Kreowski. 243-252
- Regularly controlled formal power seriesHenning Fernau, Werner Kuich. 253-265
- Forbidden subsequences and permutations sortable on two parallel stacksTero Harju, Lucian Ilie. 267-275
- Approximate identification of finite elasticitySatoshi Kobayashi, Yasubumi Sakakibara, Takashi Yokomori. 277-286
- Insertion of languages and differential semiringsGabriel Thierrin. 287-296
- Molecular structuresGabriel Ciobanu. 299-317
- A characterization of non-iterated splicing with regular rulesRay Dassen, Hendrik Jan Hoogeboom, Nike van Vugt. 319-327
- Universal and simple operations for gene assembly in ciliatesAndrzej Ehrenfeucht, Ion Petre, David M. Prescott, Grzegorz Rozenberg. 329-342
- Semi-simple splicing systemsElizabeth Goode, Dennis Pixton. 343-352
- Writing by methylation proposed for aqueous computingTom Head. 353-360
- Context-free recombinationsJarkko Kari, Lila Kari. 361-375
- Simplified simple H systemsKamala Krithivasan, Arvind Arasu. 377-386
- On some forms of splicingVincenzo Manca. 387-398
- Time-varying distributd H-systems of degree 2 generate all recursively enumerable languagesMaurice Margenstern, Yurii Rogozhin. 399-407
- On membrane computing based on splicingAndrei Paun, Mihaela Paun. 409-422
- Is evolutionary computation using DNA strands feasible?Jose Rodrigo, Juan Castellanos, Fernando Arroyo, Luis Fernando de Mingo López. 423-434
- Splicing systems using merge and separate operationsClaudio Zandron, Giancarlo Mauri, Claudio Ferretti, Paola Bonizzoni. 435-446