Abstract is missing.
- The Consequences of Eliminating NP SolutionsPiotr Faliszewski, Lane A. Hemaspaandra. 1-15
- Measuring privacy loss in statistical databasesVinod Chirayath, Luc Longpré. 16-25
- Cellular Automata and Descriptional ComplexityAndreas Malcher. 26-40
- New Directions in State ComplexityJeffrey Shallit. 41-45
- Parallel Composition of Finite State Activity AutomataTanbir Ahmed, Gösta Grahne. 46-57
- Aspects of Enumeration and Generation with a String Automata RepresentationMarco Almeida, Nelma Moreira, Rogério Reis. 58-69
- Regulated RNA rewriting: modelling RNA editing with guided insertionFranziska Biegler, Michael J. Burrell, Mark Daley. 70-81
- An Infinite Hierarchy Induced by Depth SynchronizationFranziska Biegler, Ian McQuillan, Kai Salomaa. 82-93
- On Trace Languages Generated by (Small) Spiking Neural P SystemsHaiming Chen, Mihai Ionescu, Andrei Paun, Gheorghe Paun, Bianca Popa. 94-105
- Recognizing Collapsing Words is co-NP-CompleteAlessandra Cherubini, Andrzej Kisielewicz. 106-117
- Regular Approximations of Non-Regular LanguagesBrendan J. Cordy, Kai Salomaa. 118-129
- On the Number of Active Symbols in Lindenmayer SystemsJürgen Dassow, György Vaszil. 130-140
- Transition Complexity of Language OperationsMichael Domaratzki, Kai Salomaa. 141-152
- State Complexity of Catenation and Reversal Combined with StarYuan Gao, Kai Salomaa, Sheng Yu. 153-164
- State Complexity of Prefix-Free Regular LanguagesYo-Sub Han, Kai Salomaa, Derick Wood. 165-176
- The Size of Higman-Haines SetsMarkus Holzer, Martin Kutrib. 177-187
- Descriptional Complexity of Alternating Finite AutomataJ. Kavitha, L. Jeganathan, G. Sethuraman. 188-198
- Quantum Automata for some Multiperiodic LanguagesCarlo Mereghetti, Beatrice Palano. 199-210
- A Complete Characterization of Deterministic Regular Liveness PropertiesFrank Nießner, Ulrich Ultes-Nitsche. 211-222
- Tight Bounds for the State Complexity of Deterministic Cover AutomataCezar Câmpeanu, Andrei Paun, Jason R. Smith. 223-231
- Some Separation Results Between Classes of Pointer AlgorithmsBrian Cloteaux, Desh Ranjan. 232-240
- On the Degree Complexity of Special Non-Context-Free Languages with Respect to PC Grammar SystemsJürgen Dassow, Bianca Truthe. 241-249
- Special Variants of P Systems with One Catalyst in One MembraneRudolf Freund. 250-258
- A Small Universal Antiport P System with Forbidden ContextRudolf Freund, Marion Oswald. 259-266
- Results on the Average State and Transition Complexity of Finite Automata Accepting Finite Languages (Extended Abstract)Hermann Gruber, Markus Holzer. 267-275
- A Powerful Tool in Lower-Bounding Constantly Ambiguous AutomataJoachim Kupke. 276-284