<!DOCTYPE html PUBLIC "-//W3C//DTD HTML 4.0 Transitional//EN" "http://www.w3.org/TR/REC-html40/loose.dtd">
<html><head><meta http-equiv="Content-Type" content="text/html; charset=utf-8"><title>LATA 2016: call for participation</title></head><body>*To be removed from our mailing list, please respond to this message with UNSUBSCRIBE in the<br>
subject line*<br><br>
**********************************************************************************<br><br>
10th INTERNATIONAL CONFERENCE ON LANGUAGE AND AUTOMATA THEORY AND APPLICATIONS<br><br>
LATA 2016<br><br>
Prague, Czech Republic<br><br>
March 14-18, 2016<br><br>
Organized by:<br><br>
Department of Theoretical Computer Science<br>
Faculty of Information Technology<br>
Czech Technical University in Prague<br><br>
and<br><br>
Research Group on Mathematical Linguistics (GRLMC)<br>
Rovira i Virgili University<br><br>
http://grammars.grlmc.com/lata2016/<br><br>
**********************************************************************************<br><br>
PROGRAM<br><br><br>
Monday, March 14<br><br><br>
08:55 - 09:40 Registration<br><br>
09:40 - 09:55 Opening<br><br>
09:55 - 10:45 Avrim Blum: Reconstructing Preferences from Opaque Transactions - Invited<br>
Lecture<br><br>
10:45 - 11:15 Coffee Break<br><br>
11:15 - 12:30<br><br>
Franz Baader, Andreas Ecke: Reasoning with Prototypes in the Description Logic ALC using<br>
Weighted Tree Automata<br><br>
Parvaneh Babari, Nicole Schweikardt: +ω-Picture Languages Recognizable by Büchi-Tiling<br>
Systems<br><br>
Devendra Bhave, Vrunda Dave, Krishna Shankara Narayanan, Ramchandra Phawade, Ashutosh<br>
Trivedi: A Logical Characterization for Dense-Time Visibly Pushdown Automata<br><br>
12:30 - 14:00 Lunch<br><br>
14:00 - 15:15<br><br>
Dana Fisman: A Complexity Measure on Büchi Automata<br><br>
Vahid Hashemi, Holger Hermanns, Lei Song, K. Subramani, Andrea Turrini, Piotr Wojciechowski:<br>
Compositional Bisimulation Minimization for Interval Markov Decision Processes<br><br>
Heiko Vogler, Manfred Droste, Luisa Herrmann: A Weighted MSO Logic with Storage Behaviour<br>
and its Büchi-Elgot-Trakhtenbrot Theorem<br><br>
15:15 - 15:30 Break<br><br>
15:30 - 16:45<br><br>
Rajeev Alur, Dana Fisman: Colored Nested Words<br><br>
Martin Kutrib, Andreas Malcher, Matthias Wendlandt: Input-Driven Queue Automata with<br>
Internal Transductions<br><br>
Klaus Meer, Ameen Naif: Periodic Generalized Automata over the Reals<br><br><br>
Tuesday, March 15<br><br><br>
09:00 - 09:50 Martin Grohe: Tangles and Connectivity in Graphs - Invited Lecture<br><br>
09:50 - 10:05 Break<br><br>
10:05 - 11:20<br><br>
Rick Smetsers, Joshua Moerman, David N. Jansen: Minimal Separating Sequences for All Pairs<br>
of States<br><br>
Martin Sulzmann, Peter Thiemann: Forkable Regular Expressions<br><br>
Hélène Touzet: On the Levenshtein Automaton and the Size of the Neighbourhood of a Word<br><br>
11:20 - 11:50 Coffee Break<br><br>
11:50 - 13:05<br><br>
Alexandre Blondin Massé, Mélodie Lapointe, Hugo Tremblay: Parallelogram Morphisms and<br>
Circular Codes<br><br>
Ananda Chandra Nayak, Amit K. Srivastava: On Del-Robust Primitive Partial Words with One<br>
Hole<br><br>
Maxime Crochemore, Roman Kolpakov, Gregory Kucherov: Optimal Bounds for Computing α-gapped<br>
Repeats<br><br>
13:05 - 14:35 Lunch<br><br>
14:35 - 15:50<br><br>
Kazuyuki Amano: On XOR Lemma for Polynomial Threshold Weight and Length<br><br>
Yu Chen, Xiaotie Deng, Ziwei Ji, Chao Liao: The Beachcombers' Problem: Walking and Searching<br>
from an Inner Point of a Line<br><br>
Silke Czarnetzki, Andreas Krebs: Using Duality in Circuit Complexity<br><br>
15:50 - 16:05 Break<br><br>
16:05 - 17:20<br><br>
Gabriel Istrate, Cosmin Bonchiş, Liviu Dinu: The Minimum Entropy Submodular Set Cover<br>
Problem<br><br>
Orna Kupferman, Sarai Sheinvald: On the Capacity of Capacitated Automata<br><br>
Holger Spakowski: On Limited Nondeterminism and ACC Circuit Lower Bounds<br><br><br>
Wednesday, March 16<br><br><br>
09:00 - 09:50 Frank Wolter: Automata for Ontologies - Invited Lecture<br><br>
09:50 - 10:05 Break<br><br>
10:05 - 11:20<br><br>
Kunihiro Wasa, Katsuhisa Yamanaka, Hiroki Arimura: The Complexity of Induced Tree<br>
Reconfiguration Problems<br><br>
Stefano Crespi Reghizzi, Pierluigi San Pietro: The Missing Case in Chomsky-Schützenberger<br>
Theorem<br><br>
Séverine Fratani, El Makki Voundy: Homomorphic Characterizations of Indexed Languages<br><br>
11:20 - 11:50 Group Photo and Coffee Break<br><br>
11:50 - 13:05<br><br>
Makoto Kanazawa: Ogden's Lemma, Multiple Context-Free Grammars, and the Control Language<br>
Hierarchy<br><br>
Sebastian Berndt, Rüdiger Reischuk: Steganography Based on Pattern Languages<br><br>
Guen-Hae Kim, Sang-Ki Ko, Yo-Sub Han: Inferring a Relax NG Schema from XML Documents<br><br>
13:05 - 14:35 Lunch<br><br>
14:35 - 15:50<br><br>
Atsuyoshi Nakamura, David P. Helmbold, Manfred K. Warmuth: Noise Free Multi-armed Bandit<br>
Game<br><br>
Johannes Blum, Frank Drewes: Properties of Regular DAG Languages<br><br>
Adrien Boiret: Normal Form on Linear Tree-to-Word Transducers<br><br>
16:00 - 18:00 Touristic Visit<br><br><br>
Thursday, March 17<br><br><br>
09:00 - 09:50 Romain Brenguier, Lorenzo Clemente, Paul Hunter, Guillermo A. Pérez, Mickael<br>
Randour, Jean-François Raskin, Ocan Sankur, Mathieu Sassolas: Non-zero Sum Games for<br>
Reactive Synthesis - Invited Lecture<br><br>
09:50 - 10:05 Break<br><br>
10:05 - 11:20<br><br>
Manfred Droste, Zoltán Fülöp, Doreen Götze: A Kleene Theorem for Weighted Tree Automata over<br>
Tree Valuation Monoids<br><br>
Nadia Labai, Johann A. Makowsky: Hankel Matrices for Weighted Visibly Pushdown Automata<br><br>
Johannes Osterholzer, Toni Dietze, Luisa Herrmann: Linear Context-Free Tree Languages and<br>
Inverse Homomorphisms<br><br>
11:20 - 11:50 Coffee Break<br><br>
11:50 - 13:05<br><br>
Paul C. Bell, Shang Chen, Lisa Jackson: Scalar Ambiguity and Freeness in Matrix Semigroups<br>
over Bounded Languages<br><br>
Tatiana Baginová Jajcayová: The Word Problem for HNN-Extensions of Free Inverse Semigroups<br><br>
Henrik Björklund, Frank Drewes, Petter Ericson: Between a Rock and a Hard Place - Uniform<br>
Parsing for Hyperedge Replacement DAG Grammars<br><br>
13:05 - 14:35 Lunch<br><br>
14:35 - 16:05 Giovanni Pighizzini: Restricted Turing Machines and Language Recognition (I)<br>
- Invited Tutorial<br><br>
16:05 - 16:20 Break<br><br>
16:20 - 17:10<br><br>
Sanguthevar Rajasekaran, Marius Nicolae: An Error Correcting Parser for Context-Free<br>
Grammars that Takes Less than Cubic Time<br><br>
Nathalie Bertrand, Serge Haddad, Engel Lefaucheux: Accurate Approximate Diagnosability of<br>
Stochastic Systems<br><br><br>
Friday, March 18<br><br><br>
09:00 - 10:30 Giovanni Pighizzini: Restricted Turing Machines and Language Recognition<br>
(II) - Invited Tutorial<br><br>
10:30 - 10:45 Break<br><br>
10:45 - 11:35<br><br>
Isabela Dramnesc, Tudor Jebelean, Sorin Stratulat: Proof-Based Synthesis of Sorting<br>
Algorithms for Trees<br><br>
Holger Bock Axelsen, Markus Holzer, Martin Kutrib, Andreas Malcher: Reversible Shrinking<br>
Two-pushdown Automata<br><br>
11:35 - 12:05 Coffee Break<br><br>
12:05 - 12:55<br><br>
Alberto Dennunzio, Enrico Formenti, Luca Manzoni, Antonio E. Porreca: Reachability in<br>
Resource-Bounded Reaction Systems<br><br>
Hans-Jörg Kreowski, Sabine Kuske, Aaron Lye: Canonical Multi-target Toffoli Circuits<br><br>
12:55 - 13:10 Closing</body></html>