List of Accepted Papers for LATA 2011

(alphabetically ordered)

1) Luca Aceto, Matteo Cimini, Anna Ingolfsdottir, Mohammadreza Mousavi, and Michel Reniers. Rule Formats for Distributivity
2) Dana Angluin, James Aspnes, and Raonne Barbosa Vargas. Mutation Systems
3) Marcella Anselmo, Dora Giammarresi, and Maria Madonia. Classification of String Languages via Tiling Recognizable Picture Languages
4) Agata Barecka and Witold Charatonik. The Parameterized Complexity of Chosen Problems for Finite Automata on Trees
5) Martin Berglund, Henrik Björklund, and Johanna Högberg. Recognizing Shuffled Languages
6) Francine Blanchet-Sadri, Kevin Black, and Andrew Zemke. Unary Pattern Avoidance in Partial Words Dense with Holes
7) Holger Bock Axelsen and Robert Glück. A Simple and Efficient Universal Reversible Turing Machine
8) Robert Brijder and Hendrik Blockeel. Characterizing Compressibility of Disjoint Subgraphs with NLC Grammars
9) Pascal Caron, Jean-Marc Champarnaud, and Ludovic Mignot. Partial Derivatives of an Extended Regular Expression
10) John Case, Sanjay Jain, Trong Dao Le, Yuh Shin Ong, Pavel Semukhin, and Frank Stephan. Automatic Learning of Subclasses of Pattern Languages
11) Emilie Charlier, Mike Domaratzki, Tero Harju, and Jeffrey Shallit. Finite Orbits of Language Operations
12) Krishnendu Chatterjee, Thomas Henzinger, and Florian Horn. The Complexity of Request-response Games
13) Ehud S. Conley and Shmuel Tomi Klein. Improved Alignment Based Algorithm for Multilingual Text Compression
14) Ruth Corran, Michael Hoffmann, Dietrich Kuske, and Rick Thomas. Singular Artin Monoids of Finite Coxeter Type are Automatic
15) Jürgen Dassow, Florin Manea, and Bianca Truthe. Networks of Evolutionary Processors with Subregular Filters
16) Nathanaël Fijalkow and Krishnendu Chatterjee. Finitary Languages
17) Marcus Gelderie. Classifying Regular Languages via Cascade Products of Automata
18) Jana Hadravova. The Block Structure of Successor Morphisms
19) Martin Huschenbett. Models for Quantitative Distributed Systems and Multi-valued Logics
20) Christina Jansen, Jonathan Heinen, Thomas Noll, and Joost-Pieter Katoen. A Local Greibach Normal Form for Hyperedge Replacement Grammars
21) Miroslaw Kowaluk, Andrzej Lingas, and Eva-Marta Lundell. Unique Small Subgraphs are not Easier to Find
22) Pavel Labath and Branislav Rovan. Simplifying DPDA Using Supplementary Information
23) Axel Legay, Benoit Delahaye, Mikkel L. Pedersen, Kim G. Larsen, and Andrzej Wasowski. Decision Problems for Interval Markov Chains
24) Alexei Lisitsa, Igor Potapov, and Rafiq Saleh. Planarity of Knots, Register Automata and LogSpace Computability
25) Jacek Marciniec. Tarski’s Principle, Categorial Grammars and Learnability
26) Benedek Nagy and Friedrich Otto. Globally Deterministic CD-systems of Stateless R(1)-automata
27) Lasse Nielsen and Fritz Henglein. Bit-coded Regular Expression Parsing
28) Alexander Okhotin and Kai Salomaa. Descriptional Complexity of Unambiguous Nested Word Automata
29) Kevin Perrot and Eric Remila. Avalanche Structure in the Kadanoff Sand Pile Model
30) Alberto Policriti and Alexandru I. Tomescu. Well-quasi-ordering Hereditarily Finite Sets
31) Karin Quaas. On the Interval-Bound Problem for Weighted Timed Automata
32) Daniel Reidenbach and Markus Schmid. Finding Shuffle Words that Represent Optimal Scheduling of Shared Memory Access
33) Michel Rigo and Elise Vandomme. Syntactic Complexity of Ultimately Periodic Sets of Integers
34) Arto Salomaa, Kai Salomaa, and Sheng Yu. Undecidability of the State Complexity of Composed Regular Operations
35) Natalie Schluter. Restarting Automata with Auxiliary Symbols and Small Lookahead
36) Slawek Staworko, Gregoire Laurence, Aurélien Lemay, Joachim Niehren, and Marc Tommasi. Normalization of Sequential Top-Down Tree-to-Word Transducers