| Tuesday, June 20 | |
| Social Event | |
| 17:30 - 19:30 | Reception at Ramada Palm hotel |
| Wednesday, June 21 | |
| 09:00 - 09:30 | Opening |
| 09:30 - 10:30 | Invited talk L. Hemaspaandra The consequences of eliminating NP solutions |
| 10:30 - 11:00 | M. Domaratzki, K. Salomaa Transition complexity of language operations |
| Coffee break | |
| 11:30 - 12:00 | Y. Gao, K. Salomaa, S. Yu State complexity of star of catenation and reversal |
| 12:00 - 12:30 | Y. Han, K. Salomaa, D. Wood State complexity of prefix-free regular languages |
| 12:30 - 13:00 | B. Cordy, K. Salomaa Regular approximations of non-regular languages |
| Lunch | |
| 14:30 - 15:30 | Invited talk L. Longpré Measuring privacy loss in statistical databases |
| 15:30 - 15:50 | B. Cloteaux, D. Ranjan Some separation results between classes of pointer algorithms |
| Coffee break | |
| 16:20 - 16:50 | F. Biegler, M. Burrell, M. Daley Regulated RNA rewriting: modelling RNA editing with guided insertion |
16:50 - 17:50 | Business meeting |
| Social Event | |
| 18:00 - 22:00 | Excursion (White Sands National Monument) |
| Thursday, June 22 | |
| 9:30 - 10:30 | Invited talk J. Shallit New directions in state complexity |
| 10:30 - 11:00 | F. Biegler, I. McQuillan, K. Salomaa An infinite hierarchy induced by depth synchronization |
| Coffee break | |
| 11:30 - 12:00 | M. Almeida, N. Moreira, R. Reis Aspects of enumeration and generation with a string automata representation |
| 12:00 - 12:30 | J. Dassow, G. Vaszil On the number of active symbols in Lindenmayer systems |
| 12:30 - 12:50 | J. Dassow, B. Truthe On the degree complexity of special non-context-free languages with respect to PC grammar systems |
| Lunch | |
| 14:30 - 15:00 | C. Mereghetti, B. Palano Quantum automata for some multiperiodic languages |
| 15:00 - 15:30 | M. Holzer, M. Kutrib The size of Higman-Haines sets |
| 15:30 - 16:00 | F. Niessner, U. Ultes-Nitsche A complete characterisation of deterministic regular liveness properties |
| Social Event | |
| 16:15 - 18:00 | visit to historic Mesilla Plaza |
| 18:00 - 22:00 | Conference dinner |
| Friday, June 23 | |
| 9:00 - 10:00 | Invited talk A. Malcher Cellular automata and descriptional complexity |
| 10:00 - 10:20 | H. Gruber, M. Holzer Results on the average state and transition complexity of finite automata accepting finite languages |
| 10:20 - 10:40 | C. Câmpeanu, A. Paun, J.R. Smith Tight bounds for the state complexity of deterministic cover automata |
| Coffee break | |
| 11:10 - 11:40 | A. Cherubini, A. Kisielewicz Recognizing collapsing words is co-NP-complete |
| 11:40 - 12:00 | J. Kupke A powerful tool in lower-bounding constantly ambiguous automata |
| 12:00 - 12:20 | R. Freund Special variants of P systems with one catalyst in one membrane |
| 12:20 - 12:40 | R. Freund, M. Oswald A small universal antiport P system with forbidden context |
| Lunch | |
| 14:30 - 15:00 | T. Ahmed, G. Grahne Parallel composition of finite state activity automata |
| 15:00 - 15:30 | J. Kavitha, L. Jeganathan, G. Sethuraman Descriptional complexity of alternating finite automata |
| 15:30 - 16:00 | H. Chen, M. Ionescu, A. Paun, G. Paun, B. Popa On trace languages generated by (small) spiking neural P systems |
| Closing | |