Regular papers (in Random Order)

Title	Author
Descriptional Complexity Of Alternating Finite Automata	J. Kavitha, L. Jeganathan, G. Sethuraman
On trace languages generated by (small) spiking neural P systems	H. Chen, M. Ionescu, A. Paun, G. Paun, B. Popa
Regular approximations of non-regular languages	B. Cordy, K. Salomaa
State complexity of prefix-free regular languages	Y. Han, K. Salomaa, D. Wood
An infinite hierarchy induced by depth synchronization	F. Biegler, I. McQuillan, K. Salomaa
The size of Higman-Haines sets	M. Holzer, M. Kutrib
On the number of active symbols in Lindenmayer systems	J. Dassow, G. Vaszil
State complexity of star of catenation and reversal	Y. Gao, K. Salomaa, S. Yu
Quantum automata for some multiperiodic languages	C. Mereghetti, B. Palano
Transition complexity of language operations	M. Domaratzki, K. Salomaa
A complete characterisation of deterministic regular liveness properties	F. Niessner, U. Ultes-Nitsche
Regulated RNA rewriting: modelling RNA editing with guided insertion	F. Biegler, M. Burrell, M. Daley
Aspects of enumeration and generation with a string automata representation	M. Almeida, N. Moreira, R. Reis
Parallel composition of finite state activity automata	T. Ahmed, G. Grahne
Recognizing collapsing words is co-NP-complete	A. Cherubini, A. Kisielewicz

Short papers (in Random Order)

Title	Author
On the degree complexity of special non-context-free languages with respect to PC grammar systems	J. Dassow, B. Truthe
Some separation results between classes of pointer algorithms	B. Cloteaux, D. Ranjan
A powerful tool in lower-bounding constantly ambiguous automata	J. Kupke
Special variants of P systems with one catalyst in one membrane	R. Freund
A small universal antiport P system with forbidden context	R. Freund, M. Oswald
Results on the average state and transition complexity of finite automata accepting finite languages	H. Gruber, M. Holzer
Tight bounds for the state complexity of deterministic cover automata	C. Campeanu, A. Paun, J.R. Smith