![[Valid RSS]](images/valid-rss-rogers.jpg "[Valid RSS]") |
8th International Conference on Language and Automata
Theory and Applications
, LATA 2014
|
 |
|
|
8th International Conference on Language and Automata
Theory and Applications
, LATA 2014
|
|
|
A pdf version of the program available as a banner (3M)
or a leaflet (181k - to be printed on both sides).
| Monday, March 10 | |
| 9:30 - 10:30 | Registration |
| 10:30 - 10:40 | Opening |
| 10:40 - 11:30 L. A. Goldberg | Helmut Seidl: Interprocedural Information Flow Analysis of XML Processors - Invited Lecture |
| 11:30 - 11:45 | Break |
| 11:45 - 13:00 Pierre Ganty | Alberto Dennunzio, Enrico Formenti, Luca Manzoni: Extremal Combinatorics of Reaction Systems |
| Fernando Arroyo, Sandra Gómez Canaval, Victor Mitrana, Ștefan Popescu: Networks of Polarized Evolutionary Processors are Computationally Complete | |
| Liang Ding, Abdul Samad, Xingran Xue, Xiuzhen Huang, Russell L. Malmberg, Liming Cai: Stochastic k-Tree Grammar and its Application in Biomolecular Structure Modeling | |
| 13:00 - 14:30 | Lunch |
| 14:30 - 15:45 Yo-Sub Han | Béatrice Bérard, Olivier Carton: Channel Synthesis Revisited |
| Daniel Průša: Weight-reducing Hennie Machines and Their Descriptional Complexity | |
| Manfred Droste, Stefan Dück: Weighted Automata and Logics for Infinite Nested Words | |
| 15:45 - 16:00 | Break |
| 16:00 - 17:15 Manfred Droste | Friedrich Otto, František Mráz: Extended Two-Way Ordered Restarting Automata for Picture Languages |
| Sang-Ki Ko, Yo-Sub Han, Kai Salomaa: Top-Down Tree Edit-Distance of Regular Tree Languages | |
| Bertram Felgenhauer, René Thiemann: Reachability Analysis with State-Compatible Automata | |
| 17:15 - 17:45 | Coffee Break |
| 17:45 - 18:35 Béatrice Bérard | Leslie A. Goldberg: The Complexity of Approximate Counting - Invited Lecture |
| Tuesday, March 11 | |
| 9:00 - 9:50 Helmut Seidl | Sanjeev Khanna: Matchings, Random Walks, and Sampling - Invited Lecture |
| 9:50 - 10:00 | Break |
| 10:00 - 11:15
Jacobo Torán | Niko Beerenwinkel, Stefano Beretta, Paola Bonizzoni, Riccardo Dondi, Yuri Pirola: Covering Pairs in Directed Acyclic Graphs |
| Eike Best, Raymond Devillers: Characterisation of the State Spaces of Live and Bounded Marked Graph Petri Nets | |
| María Martos-Salgado, Fernando Rosa-Velardo: Expressiveness of Dynamic Networks of Timed Petri Nets | |
| 11:15 - 11:45 | Coffee Break |
| 11:45 - 13:00
Fernando Arroyo | Bireswar Das, Patrick Scharpfenecker, Jacobo Torán: Succinct Encodings of Graph Isomorphism |
| Matthias Gallé, Matías Tealdi: On Context-Diverse Repeats and their Incremental Computation | |
| Marcella Anselmo, Dora Giammarresi, Maria Madonia: Picture Codes with Finite Deciphering Delay | |
| 13:00 - 14:30 | Lunch |
| 14:30 - 15:45 Gill Barequet | Paul Tarau: Computing with Catalan Families |
| Joan Boyar, Shahin Kamali, Kim S. Larsen, Alejandro López-Ortiz: On the List Update Problem with Advice | |
| Rob Gysel: Minimal Triangulation Algorithms for Perfect Phylogeny Problems | |
| 15:45 - 16:00 | Break |
| 16:00 - 17:15 Paul Tarau | Grégoire Laurence, Aurélien Lemay, Joachim Niehren, Sławek Staworko, Marc Tommasi: Learning Sequential Tree-to-word Transducers |
| Dariusz Kalociński: On Computability and Learnability of the Pumping Lemma Function | |
| Slimane Bellaouar, Hadda Cherroun, Djelloul Ziadi: Efficient List-based Computation of the String Subsequence Kernel | |
| Wednesday, March 12 | |
| 9:00 - 9:50
S. Khanna | Oscar H. Ibarra: On the Parikh Membership Problem for FAs, PDAs, and CMs - Invited Lecture |
| 9:50 - 10:00 | Break |
| 10:00 - 11:15
Friedrich Otto | Marius Konitzer, Hans Ulrich Simon: DFA with a Bounded Activity Level |
| Shenggen Zheng, Jozef Gruska, Daowen Qiu: On the State Complexity of Semi-Quantum Finite Automata | |
| Vojtěch Vorel: Complexity of a Problem Concerning Reset Words for Eulerian Binary Automata | |
| 11:15 - 11:45 | Coffee Break |
| 11:45 - 13:00
Daowen Qiu | Pascal Caron, Marianne Flouret, Ludovic Mignot: (k,l)-Unambiguity and Quasi-Deterministic Structures: an Alternative for the Determinization |
| Zuzana Bednárová, Viliam Geffert: Two Double-Exponential Gaps for Automata with a Limited Pushdown | |
| Parosh Aziz Abdulla, Mohamed Faouzi Atig, Jari Stenman: Computing Optimal Reachability Costs in Priced Dense-Timed Pushdown Automata | |
| 13:00 - 14:30 | Lunch |
| 15:45 - 17:45 | Sightseeing in Madrid by Bus |
| Thursday, March 13 | |
| 9:00 - 9:50 Oscar H. Ibarra | Javier Esparza: A Brief History of Strahler Numbers (I) - Invited Tutorial |
| 9:50 - 10:00 | Break |
| 10:00 - 11:15
Hans Simon | Zeinab Mazadi, Ziyuan Gao, Sandra Zilles: Distinguishing Pattern Languages with Membership Examples |
| Francine Blanchet-Sadri, Andrew Lohr, Sean Simmons, Brent Woodhouse: Computing Depths of Patterns | |
| Alexandre Blondin Massé, Sébastien Gaboury, Sylvain Hallé, Michaël Larouche: Solving Equations on Words with Morphisms and Antimorphisms | |
| 11:15 - 11:45 | Coffee Break |
| 11:45 - 13:00
Luca Manzoni | Anton Cerný: Solutions to the Multi-Dimensional Equal Powers Problem Constructed by Composition of Rectangular Morphisms |
| Enrico Formenti, Markus Holzer, Martin Kutrib, Julien Provillard: ω-rational Languages: High Complexity Classes vs. Borel Hierarchy | |
| Thomas Weidner: Probabilistic ω-Regular Expressions | |
| 13:00 - 14:30 | Lunch |
| 14:30 - 15:45
Luca Breveglieri | Haizhou Li, François Pinet, Farouk Toumani: Probabilistic Simulation for Probabilistic Data-aware Business Processes |
| Daniel Bundala, Jakub Závodný: Optimal Sorting Networks | |
| Etienne Dubourg, David Janin: Algebraic Tools for the Overlapping Tile Product | |
| 15:45 - 16:00 | Break |
| 16:00 - 17:15
Oliver Kullmann | Luca Breveglieri, Stefano Crespi Reghizzi, Angelo Morzenti: Shift-Reduce Parsers for Transition Networks |
| Gadi Aleksandrowicz, Andrei Asinowski, Gill Barequet, Ronnie Barequet: Formulae for Polyominoes on Twisted Cylinders | |
| Alexandre Blondin Massé, Amadou Makhtar Tall, Hugo Tremblay: On the Arithmetics of Discrete Figures | |
| Friday, March 14 | |
| 9:00 - 9:50
Oscar H. Ibarra | Javier Esparza: A Brief History of Strahler Numbers (II) - Invited Tutorial |
| 9:50 - 10:00 | Break |
| 10:00 - 11:15 Raymond Devillers | Hanna Klaudel, Maciej Koutny, Zhenhua Duan: Interval Temporal Logic Semantics of Box Algebra |
| Pierre Ganty, Ahmed Rezine: Ordered Counter-Abstraction: Refinable Subword Relations for Parameterized Verification | |
| Matthew Gwynne, Oliver Kullmann: On SAT Representations of XOR Constraints | |
| 11:15 - 11:45 | Coffee Break |
| 11:45 - 13:00
Maciej Koutny | Bernd Finkbeiner, Hazem Torfah: Counting Models of Linear-time Temporal Logic |
| Claudia Carapelle, Shiguang Feng, Oliver Fernández Gil, Karin Quaas: Satisfiability for MTL and TPTL over Non-Monotonic Data Words | |
| Joachim Klein, David Müller, Christel Baier, Sascha Klüppelholz: Are Good-for-games Automata Good for Probabilistic Model Checking? | |
| 13:00 | Closing |