and Automata Theory and Applications LATA 2010, May 24 - 28, 2010 Trier, Germany Programme |
| (Pdf versions available for the following formats: A3/A4 and leaflet) |
| Monday, May 24 | |
| 9:00 - 9:25 | Registration |
| 9:25 - 9:40 | Opening |
| 9:40 - 10:40 T. Zeugmann | Janusz Brzozowski: Complexity in Convex Languages - Invited Talk |
| 10:40 - 11:10 | Coffee Break |
| 11:10 - 12:25 A. N. Arslan | Jérémie Cabessa and Alessandro Villa: A Hierarchical Classification of First-Order Recurrent Neural Networks |
| Fernando Rosa-Velardo and Giorgio Delzanno: Language-Based Comparison of Petri Nets with Black Tokens, Pure Names and Ordered Data | |
| Stefano Crespi Reghizzi and Dino Mandrioli: Operator Precedence and the Visibly Pushdown Property | |
| 12:25 - 13:45 | Lunch |
| 13:45 - 15:00 S. Rahmann | Turlough Neary: A Boundary Between Universality and Non-universality in Extended Spiking Neural P Systems |
| Abdullah N. Arslan: A Fast Longest Common Subsequence Algorithm for Similar Strings | |
| Pablo Arrighi and Jonathan Grattage: A Simple n-Dimensional Intrinsically Universal Quantum Cellular Automaton | |
| 15:00 - 15:20 | Coffee Break |
| 15:20 - 17:25 M. Plátek | Peter Leupold: Primitive Words are Unavoidable for Context-Free Languages |
| Francine Blanchet-Sadri, Robert Merca s, Sean Simmons, and Eric Weissenstein: Avoidable Binary Patterns in Partial Words | |
| Francine Blanchet-Sadri, Jane Kim, Robert Merca s, William Severa, and Sean Simmons: Abelian Square-Free Partial Words | |
| Florin Manea and Catalin Tiseanu: Hard Counting Problems for Partial Words | |
| Maxime Crochemore, Costas Iliopoulos, Marcin Kubica, Jakub Radoszewski, Wojciech Rytter, and Tomasz Wale\'n: On the Maximal Number of Cubic Runs in a String | |
| 19:00 | Welcome Meeting |
| Tuesday, May 25 | |
| 8:50 - 9:50 F. Stephan | Alexander Clark: Three Learnable Models for the Description of Language - Invited Talk |
| 9:50 - 10:20 | Coffee Break |
| 10:20 - 12:25
B. Nagy | Sanjay Jain, Qinglong Luo, and Frank Stephan: Learnability of Automatic Classes |
| Christophe Costa Florêncio and Henning Fernau: Finding Consistent Categorial Grammars of Bounded Value: a Parameterized Approach | |
| Anna Kasprzik and Timo Kötzing: String Extension Learning using Lattices | |
| Rafael Carrascosa, François Coste, Matthias Gallé, and Gabriel Infante-Lopez: Choosing Word Occurrences for the Smallest Grammar Problem | |
| Tobias Marschall and Sven Rahmann: Exact Analysis of Horspool's and Sunday's Pattern Matching Algorithms with Probabilistic Arithmetic Automata | |
| 12:25 - 13:45 | Lunch |
| 13:45 - 15:00
T. Neary | Neda Saeedloei and Gopal Gupta: Verifying Complex Continuous Real-Time Systems with Coinductive CLP(R) |
| Charles Jordan and Thomas Zeugmann: Untestable Properties Expressible with Four First-Order Quantifiers | |
| Christian Choffrut, Andreas Malcher, Carlo Mereghetti, and Beatrice Palano: On the Expressive Power of FO[+] | |
| 15:00 - 15:20 | Coffee Break |
| 15:20 - 17:25
F. Manea | Hans Zantema: Complexity of Guided Insertion-Deletion in RNA-Editing |
| Nimrod Milo, Tamar Pinhas, and Michal Ziv-Ukelson: SA-REPC - Sequence Alignment with Regular Expression Path Constraint | |
| Muthiah Sakthi Balan and Parameswaran Seshan: Incremental Building in Peptide Computing to Solve Hamiltonian Path Problem | |
| Alberto Policriti, Alexandru I. Tomescu, and Francesco Vezzi: A Randomized Numerical Aligner (rNA) | |
| Frank Weinberg and Markus Nebel: Extending Stochastic Context-Free Grammars for an Application in Bioinformatics | |
| Wednesday, May 26 | |
| 8:30 - 9:30
W. Rytter | Borivoj Melichar: Arbology: Trees and Pushdown Automata - Invited Talk |
| 9:30 - 10:00 | Coffee Break |
| 10:00 - 12:05
K. Reinhardt | Nicolas Bousquet and Christof Löding: Equivalence and Inclusion Problem for Strongly Unambiguous Büchi Automata |
| Hellis Tamm: Some Minimality Results on Biresidual and Biseparable Automata | |
| Martin Kutrib and Andreas Malcher: Reversible Pushdown Automata | |
| Barbara Klunder and Wojciech Rytter: Post Correspondence Problem with Partially Commutative Alphabets | |
| Barbara Di Giampaolo, Salvatore La Torre, and Margherita Napoli: Parametric Metric Interval Temporal Logic | |
| 12:05 | Lunch, Excursion … |
| Thursday, May 27 | |
| 8:50 - 9:50 F. Otto | Anca Muscholl: Analysis of Communicating Automata - Invited Talk |
| 9:50 - 10:20 | Coffee Break |
| 10:20 - 12:25
P. Leupold | Makoto Kanazawa and Sylvain Salvati: The Copying Power of Well-Nested Multiple Context-Free Grammars |
| Ryo Yoshinaka, Yuichi Kaji, and Hiroyuki Seki: Chomsky-Schützenberger-Type Characterization of Multiple Context-Free Languages | |
| Dag Hovland: The Inclusion Problem for Regular Expressions | |
| Hermann Gruber and Stefan Gulan: Simplifying Regular Expressions. A Quantitative Perspective | |
| Reinhard Hemmerling, Katarína Smolenová, and Winfried Kurth: A Programming Language Tailored to the Specification and Solution of Differential Equations Describing Processes on Networks | |
| 12:25 - 13:45 | Lunch |
| 13:45 - 15:00
H. Zantema | Jean-Marc Champarnaud, Jean-Philippe Dubernard, and Hadrien Jeanne: Geometricity of Binary Regular Languages |
| Alexander Letichevsky, Arsen Shoukourian, and Samvel Shoukourian: The Equivalence Problem of Deterministic Multitape Finite Automata. A New Proof of Solvability Using a Multidimensional Tape | |
| Rüdiger Ehlers: Short Witnesses and Accepting Lassos in ω-Automata | |
| 15:00 - 15:20 | Coffee Break |
| 15:20 - 16:35
M. Kutrib | Benedek Nagy and Friedrich Otto: CD-Systems of Stateless Deterministic R(1)-Automata Accept All Rational Trace Languages |
| Martin Plátek, Frantisek Mráz, and Markéta Lopatková: Restarting Automata with Structured Output and Functional Generative Description | |
| Orna Grumberg, Orna Kupferman, and Sarai Sheinvald: Variable Automata over Infinite Alphabets | |
| 16:35 - 16:45 | Break |
| 16:45 - 17:30 | Open problems session: Future directions and challenges |
| Friday, May 28 | |
| 8:30 - 9:45
F. Blanchet-Sadri | Travis Gagie and Pawe Gawrychowski: Grammar-Based Compression in a Streaming Model |
| Zhe Lin: Modal Nonassociative Lambek Calculus with Assumptions: Complexity and Context-Freeness | |
| Wojciech Buszkowski and Zhe Lin: Pregroup Grammars with Letter Promotions | |
| 9:45 - 10:00 | LATA 2011 Presentation |
| 10:00 - 10:25 | Coffee Break |
| 10:25 - 12:05
W. Buszkowski | William Cruz-Santos and Guillermo Morales-Luna: On the Hamiltonian Operators for Adiabatic Quantum Reduction of SAT |
| Claudia Casadio: Agreement and Cliticization in Italian: a Pregroup Analysis | |
| Vincent Aravantinos, Ricardo Caferra, and Nicolas Peltier: Complexity of the Satisfiability Problem for a Class of Propositional Schemata | |
| Rafael Peñaloza: Using Sums-of-Products for Non-standard Reasoning | |
| 12:05 | Closing |
We acknowledge the support by:
 Universität Trier |
 Universitat Rovira i Virgili Tarragona |
|
File translated from TEX by TTH, version 3.87.
On 08 Apr 2010, 18:43.