Abstract is missing.
- Semidirect Products With the Pseudovariety of All Finite GroupsJorge Almeida, Ana Paula Escada. 1-21
- On the Sentence Valuations in a SemiringAdrian Atanasiu, Carlos Martín-Vide, Victor Mitrana. 22-39
- Join Decompositions of Pseudovarieties of the Form DH EComKarl Auinger. 40-50
- Arithmetical Complexity of Infinite WordsSergey V. Avgustinovich, Dmitry Fon-Der-Flaass, Anna E. Frid. 51-62
- The Emperor's New Recursiveness: The Epigraph of the Exponential Function in Two Models of ComputabilityVasco Brattka. 63-72
- Iterative Arrays With Limited Nondeterministic Communication CellThomas Buchholz, Andreas Klein, Martin Kutrib. 73-87
- R-Trivial Languages of Words on Countable OrdinalsOlivier Carton. 88-102
- The Theory of Rational Relations on Transfinite StringsChristian Choffrut, Serge Grigorieff. 103-133
- Networks of Watson-Crick D0L SystemsErzsébet Csuhaj-Varjú, Arto Salomaa. 134-150
- On the Differentiation Function of some Language Generating DevicesJürgen Dassow. 151-161
- Visualization of Cellular AutomataMaria Demeny, Géza Horváth, Csaba Nagylaki, Zoltan Nagylaki. 162-170
- On A Class of HypercodesDo Long Van. 171-182
- A Parsing Problem for Context-Sensitive LanguagesPál Dömösi, Masami Ito. 183-184
- An Improvement of Iteration Lemmata for Context-free LanguagesPál Dömösi, Manfred Kudlek. 185-191
- Quantum Finite AutomataJozef Gruska, Roland Vollmar. 192-211
- On Commutative Asynchronous AutomataBalázs Imreh, Masami Ito, Antal Pukler. 212-221
- Presentations of Right Unitary Submonoids of MonoidsIsamu Inata. 222-227
- A Combinatorial Property of Languages and MonoidsAndrei V. Kelarev, Peter G. Trotter. 228-239
- Error-Detecting Properties of LanguagesStavros Konstantinidis. 240-252
- A Note on Finding One-Variable Patterns Consistent with Examples and CounterexamplesTakeshi Koshiba, Kunihiko Hiraishi. 253-265
- On the Star Height of Rational Languages: A New Presentation for Two Old ResultsSylvain Lombardy, Jacques Sakarovitch. 266-285
- Some Properties of Hyperoperations and HyperclonesHajime Machida. 286-296
- Words Guaranteeing Minimal ImageStuart W. Margolis, Jean-Eric Pin, Mikhail V. Volkov. 297-310
- Power Semigroups and Polynomial ClosureStuart W. Margolis, Benjamin Steinberg. 311-322
- Routes and TrajectoriesAlexandru Mateescu. 323-338
- Characterization of Valuation Rings and Valuation Semigroups by Semistar-OperationsRyuki Matsuda. 339-351
- Further Results on Restarting AutomataGundula Niemann, Friedrich Otto. 352-369
- Cellular Automata with Polynomials over Finite FieldsHidenosuke Nishio. 370-377
- Generalized Directable AutomataZarko Popovic, Stojan Bogdanovic, Tatjana Petkovic, Miroslav Ciric. 378-395
- Acts over Right, Left Regular Bands and Semilattices TypesTatsuhiko Saito. 396-402
- Two Optimal Parallel Algorithms on the Commutation Class of a WordRené Schott, Jean-Claude Spehner. 403-419
- A Proof of Okninski, Putcha's TheoremKunitaka Shoji. 420-427
- Subdirect Product Structure of Left Clifford SemigroupsK. P. Shum, M. K. Sen, Y. Q. Guo. 428-433
- Tree Automata in the Theory of Term RewritingMagnus Steinby. 434-449
- Key Agreement Protocol Securer than DLOGAkihiro Yamamura, Kaoru Kurosawa. 450-465
- A Note on Rademacher Functions and ComputabilityMariko Yasugi, Masako Washihara. 466-475