and Automata Theory and Applications LATA 2010, May 26 - 31, 2011 Tarragona, Spain Programme and Slides |
| Pdf versions of the Programme available as a banner (4.4M) or a leaflet. | |
| The slides are accessible clicking on the titles of the papers. |
| Thursday, May 26 | |
| 8:00 - 8:50 | Registration |
| 8:50 - 9:00 | Opening |
| 9:00 - 9:50 Sheng Yu | Bakhadyr Khoussainov: Automatic Structures and Groups (I) - Invited Tutorial |
| 9:50 - 10:00 | Break |
| 10:00 - 11:40 Benedek Nagy | Arto Salomaa, Kai Salomaa, Sheng Yu: Undecidability of the State Complexity of Composed Regular Operations |
| Alexei Lisitsa, Igor Potapov, Rafiq Saleh: Planarity of Knots, Register Automata and LogSpace Computability | |
| Alexander Okhotin, Kai Salomaa: Descriptional Complexity of Unambiguous Nested Word Automata | |
| Francine Blanchet-Sadri, Kevin Black, Andrew Zemke: Unary Pattern Avoidance in Partial Words Dense with Holes | |
| 11:40 - 12:10 | Coffee Break |
| 12:10 - 13:50 Narad Rampersad | Natalie Schluter: Restarting Automata with Auxiliary Symbols and Small Lookahead |
| Benedek Nagy, Friedrich Otto: Globally Deterministic CD-Systems of Stateless R(1)-Automata | |
| Luca Aceto, Matteo Cimini, Anna Ingolfsdottir, Mohammad Reza Mousavi, Michel A. Reniers: Rule Formats for Distributivity | |
| Marcella Anselmo, Dora Giammarresi, Maria Madonia: Classification of String Languages via Tiling Recognizable Picture Languages | |
| 13:50 - 15:30 | Lunch |
| 15:30 - 16:20 Francine Blanchet-Sadri | Dana Angluin, James Aspnes, Raonne Barbosa Vargas: Mutation Systems |
| Jürgen Dassow, Florin Manea, Bianca Truthe: Networks of Evolutionary Processors with Subregular Filters | |
| 16:20 - 16:30 | Break |
| 16:30 - 17:20 Alexander Okhotin | Narad Rampersad: Abstract Numeration Systems - Invited Talk |
| Friday, May 27 | |
| 9:00 - 9:50 Sheng Yu | Bakhadyr Khoussainov: Automatic Structures and Groups (II) - Invited Tutorial |
| 9:50 - 10:00 | Break |
| 10:00 - 11:40 Henrik Björklund | Mirosław Kowaluk, Andrzej Lingas, Eva-Marta Lundell: Unique Small Subgraphs are not Easier to Find |
| Alberto Policriti, Alexandru I. Tomescu: Well-quasi-ordering Hereditarily Finite Sets | |
| Robert Brijder, Hendrik Blockeel: Characterizing Compressibility of Disjoint Subgraphs with NLC Grammars | |
| Christina Jansen, Jonathan Heinen, Joost-Pieter Katoen, Thomas Noll: A Local Greibach Normal Form for Hyperedge Replacement Grammars | |
| 11:40 - 12:10 | Coffee Break |
| 12:10 - 13:50 Robert Brijder | Grégoire Laurence, Aurélien Lemay, Joachim Niehren, Sławek Staworko, Marc Tommasi: Normalization of Sequential Top-Down Tree-to-Word Transducers |
| Pavel Labath, Branislav Rovan: Simplifying DPDA Using Supplementary Information | |
| Karin Quaas: On the Interval-Bound Problem for Weighted Timed Automata | |
| Benoît Delahaye, Kim G. Larsen, Axel Legay, Mikkel L. Pedersen, Andrzej Wąsowski: Decision Problems for Interval Markov Chains | |
| 13:50 - 15:30 | Lunch |
| 15:30 - 16:45 Bakhadyr Khoussainov | Ruth Corran, Michael Hoffmann, Dietrich Kuske, Richard M. Thomas: Singular Artin Monoids of Finite Coxeter Type are Automatic |
| Émilie Charlier, Mike Domaratzki, Tero Harju, Jeffrey Shallit: Finite Orbits of Language Operations | |
| Jana Hadravová: The Block Structure of Successor Morphisms | |
| 17:30 | Visit to the Old City |
| Monday, May 30 | |
| 9:00 - 9:50 Shunsuke Inenaga | Jérôme Leroux: Vector Addition System Reachability Problem: A Short Self-Contained Proof (I) - Invited Tutorial |
| 9:50 - 10:00 | Break |
| 10:00 - 11:40 Kevin Knight | Krishnendu Chatterjee, Thomas A. Henzinger, Florian Horn: The Complexity of Request-Response Games |
| Michel Rigo, Élise Vandomme: Syntactic Complexity of Ultimately Periodic Sets of Integers | |
| Agata Barecka, Witold Charatonik: The Parameterized Complexity of Chosen Problems for Finite Automata on Trees | |
| Krishnendu Chatterjee, Nathanaël Fijalkow: Finitary Languages | |
| 11:40 - 12:10 | Coffee Break |
| 12:10 - 13:50 Thomas Colcombet | Daniel Reidenbach, Markus L. Schmid: Finding Shuffle Words that Represent Optimal Scheduling of Shared Memory Access |
| Martin Berglund, Henrik Björklund, Johanna Högberg: Recognizing Shuffled Languages | |
| Ehud S. Conley, Shmuel T. Klein: Improved Alignment Based Algorithm for Multilingual Text Compression | |
| Lasse Nielsen, Fritz Henglein: Bit-Coded Regular Expression Parsing | |
| 13:50 - 15:30 | Lunch |
| 15:30 - 16:20
Florian Horn | John Case, Sanjay Jain, Trong Dao Le, Yuh Shin Ong, Pavel Semukhin, Frank Stephan: Automatic Learning of Subclasses of Pattern Languages |
| Jacek Marciniec: Tarski's Principle, Categorial Grammars and Learnability | |
| 16:20 - 16:30 | Break |
| 16:30 - 17:20 Sanjay Jain | Thomas Colcombet: Green's Relations and their Use in Automata Theory - Invited Talk (Adobe Flash Player needed; click on the presentation to start and to go to the next slide) |
| Tuesday, May 31 | |
| 9:00 - 9:50 Shunsuke Inenaga | Jérôme Leroux: Vector Addition System Reachability Problem: A Short Self-Contained Proof (II) - Invited Tutorial |
| 9:50 - 10:00 | Break |
| 10:00 - 11:15 Jérôme Leroux | Martin Huschenbett: Models for Quantitative Distributed Systems and Multi-Valued Logics |
| Holger Bock Axelsen, Robert Glück: A Simple and Efficient Universal Reversible Turing Machine | |
| Kévin Perrot, Eric Rémila: Avalanche Structure in the Kadanoff Sand Pile Model | |
| 11:15 - 11:45 | Coffee Break |
| 11:45 - 12:35 Johanna Högberg | Pascal Caron, Jean-Marc Champarnaud, Ludovic Mignot: Partial Derivatives of an Extended Regular Expression |
| Marcus Gelderie: Classifying Regular Languages via Cascade Products of Automata | |
| 12:35 - 12:45 | Break |
| 12:45 - 13:35 Émilie Charlier | Kevin Knight: Automata for Deciphering Natural Language - Invited Talk |
| 13:35 - 13:50 | Closing |
| 13:50 | Lunch |