Abstract is missing.
- Adding Nesting Structure to WordsRajeev Alur, P. Madhusudan. 1-13 [doi]
- Can Abstract State Machines Be Useful in Language Theory?Yuri Gurevich, Charles Wallace. 14-19 [doi]
- Languages in Membrane Computing: Some Details for Spiking Neural P SystemsGheorghe Paun. 20-35 [doi]
- Computational Nature of Biochemical ReactionsAndrzej Ehrenfeucht, Grzegorz Rozenberg. 36 [doi]
- Polynomials, Fragments of Temporal Logic and the Variety DA over TracesManfred Kufleitner. 37-48 [doi]
- Weighted Automata and Weighted Logics on Infinite WordsManfred Droste, George Rahonis. 49-58 [doi]
- Simulation Relations for Alternating Parity Automata and Parity GamesCarsten Fritz, Thomas Wilke. 59-70 [doi]
- Equivalence of Functions Represented by Simple Context-Free Grammars with OutputCédric Bastien, Jurek Czyzowicz, Wojciech Fraczak, Wojciech Rytter. 71-82 [doi]
- On the Gap-Complexity of Simple RL-AutomataFrantisek Mráz, Friedrich Otto, Martin Plátek. 83-94 [doi]
- Noncanonical LALR(1) ParsingSylvain Schmitz. 95-107 [doi]
- Context-Free Grammars and XML LanguagesAlberto Bertoni, Christian Choffrut, Beatrice Palano. 108-119 [doi]
- Synchronization of Pushdown AutomataDidier Caucal. 120-132 [doi]
- Context-Dependent Nondeterminism for Pushdown AutomataMartin Kutrib, Andreas Malcher. 133-144 [doi]
- Prime Decompositions of Regular LanguagesYo-Sub Han, Kai Salomaa, Derick Wood. 145-155 [doi]
- On Weakly Ambiguous Finite TransducersNicolae Santean, Sheng Yu. 156-167 [doi]
- Ciliate Bio-operations on Finite String MultisetsJürgen Dassow, György Vaszil. 168-179 [doi]
- Characterizing DNA Bond Shapes Using TrajectoriesMichael Domaratzki. 180-191 [doi]
- Involution Solid and Join CodesNatasa Jonoska, Lila Kari, Kalpana Mahalingam. 192-202 [doi]
- Well-Founded Semantics for Boolean GrammarsVassilis Kountouriotis, Christos Nomikos, Panos Rondogiannis. 203-214 [doi]
- Hierarchies of Tree Series Transformations RevisitedAndreas Maletti. 215-225 [doi]
- Bag Context Tree GrammarsFrank Drewes, Christine du Toit, Sigrid Ewert, Brink van der Merwe, Andries P. J. van der Walt. 226-237 [doi]
- Closure of Language Classes Under Bounded DuplicationMasami Ito, Peter Leupold, Kayoko Shikishima-Tsuji. 238-247 [doi]
- The Boolean Closure of Growing Context-Sensitive LanguagesTomasz Jurdzinski. 248-259 [doi]
- Well Quasi Orders and the Shuffle Closure of Finite SetsFlavio D Alessandro, Gwénaël Richomme, Stefano Varricchio. 260-269 [doi]
- The Growth Ratio of Synchronous Rational Relations Is UniqueOlivier Carton. 270-279 [doi]
- On Critical Exponents in Fixed Points of Non-erasing MorphismsDalia Krieger. 280-291 [doi]
- P Systems with Proteins on Membranes and Membrane DivisionAndrei Paun, Bianca Popa. 292-303 [doi]
- Computing by Only ObservingMatteo Cavaliere, Pierluigi Frisco, Hendrik Jan Hoogeboom. 304-314 [doi]
- A Decision Procedure for Reflexive Regular Splicing LanguagesPaola Bonizzoni, Giancarlo Mauri. 315-326 [doi]
- Contextual Hypergraph Grammars - A New Approach to the Generation of Hypergraph LanguagesAdrian Horia Dediu, Renate Klempien-Hinrichs, Hans-Jörg Kreowski, Benedek Nagy. 327-338 [doi]
- End-Marked Maximal Depth-First Contextual GrammarsK. Lakshmanan. 339-350 [doi]
- Some Examples of Semi-rational DAG LanguagesJan Robert Menzel, Lutz Priese, Monika Schuth. 351-362 [doi]
- Finding Lower Bounds for Nondeterministic State Complexity Is HardHermann Gruber, Markus Holzer. 363-374 [doi]
- Lowering Undecidability Bounds for Decision Questions in MatricesPaul Bell, Igor Potapov. 375-385 [doi]
- Complexity of Degenerated Three Dimensional Billiard WordsJean-Pierre Borel. 386-396 [doi]
- Factorial Languages of Low Combinatorial ComplexityArseny M. Shur. 397-407 [doi]
- Perfect Correspondences Between Dot-Depth and Polynomial-Time HierarchyChristian Glaßer, Stephen D. Travers, Klaus W. Wagner. 408-419 [doi]
- Language Equations with ComplementationAlexander Okhotin, Oksana Yakimova. 420-432 [doi]
- Synchronizing Automata with a Letter of Deficiency 2Dimitry S. Ananichev, Mikhail V. Volkov, Yu. I. Zaks. 433-442 [doi]
- On Some Variations of Two-Way Probabilistic Finite Automata ModelsBala Ravikumar. 443-454 [doi]