<!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 2017: call for participation</title></head><body>******************************************************************************<br><br>
11th INTERNATIONAL CONFERENCE ON LANGUAGE AND AUTOMATA THEORY AND APPLICATIONS<br><br>
LATA 2017<br><br>
Umeå, Sweden<br><br>
March 6-9, 2017<br><br>
Organized by:<br>
<br>
Department of Computing Science<br>
Umeå University<br><br>
Research Group on Mathematical Linguistics (GRLMC)<br>
Rovira i Virgili University<br><br>
http://grammars.grlmc.com/LATA2017/<br><br>
******************************************************************************<br><br>
PROGRAM<br><br>
Monday, March 6<br><br>
09:00 - 09:30 Registration<br><br>
09:30 - 09:40 Opening<br><br>
09:40 - 10:30<br><br>
Thomas Wilke: Finite Backward Deterministic Automata on Infinite Words - Invited Lecture<br><br>
10:30 - 11:00 Coffee Break<br><br>
11:00 - 12:15<br><br>
Thomas Troels Hildebrandt, Christian Johansen, Håkon Normann: A Stable Non-interleaving Early Operational Semantics for the Pi-calculus<br>
Adam Jardine, Kevin McMullin: Efficient Learning of Tier-based Strictly k-Local Languages<br>
Makoto Kanazawa, Ryo Yoshinaka: The Strong, Weak, and Very Weak Finite Context and Kernel Properties<br><br>
12:15 - 13:45 Lunch<br><br>
13:45 - 15:00<br><br>
Benedikt Brütsch, Patrick Landwehr, Wolfgang Thomas: N-Memory Automata Over the Alphabet N<br>
Lisa Hutschenreiter, Rafael Peñaloza: An Automata View to Goal-directed Methods<br>
Ruggero Lanotte, Massimo Merro: A Calculus of Cyber-Physical Systems<br><br>
15:00 - 15:15 Break<br><br>
15:15 - 16:30<br><br>
Costas S. Iliopoulos, Ritu Kundu, Solon P. Pissis: Efficient Pattern Matching in Elastic-Degenerate Texts<br>
Shmuel Tomi Klein, Dana Shapira: Integrated Encryption in Dynamic Arithmetic Compression<br>
Manasi S. Kulkarni, Kalpana Mahalingam: Two-Dimensional Palindromes and Their Properties<br><br>
---<br><br>
Tuesday, March 7<br><br>
09:00 - 09:50<br><br>
Georg Gottlob, Christoph Koch, Andreas Pieris: Logic, Languages, and Rules for Web Data Extraction and Reasoning over Data - Invited Lecture<br><br>
09:50 - 10:20 Coffee Break<br><br>
10:20 - 11:35<br><br>
Janusz A. Brzozowski, Corwin Sinnamon: Complexity of Left-Ideal, Suffix-Closed and Suffix-Free Regular Languages<br>
Nadia Creignou, Markus Kröll, Reinhard Pichler, Sebastian Skritek, Heribert Vollmer: On the Complexity of Hard Enumeration Problems<br>
Yo-Sub Han, Sang-Ki Ko, Timothy Ng, Kai Salomaa: Consensus String Problem for Multiple Regular Languages<br><br>
11:35 - 13:05 Lunch<br><br>
13:05 - 14:20<br><br>
Johannes Schmidt: The Weight in Enumeration<br>
Johanna Björklund, Loek Cleophas: Minimization of Finite State Automata Through Partition Aggregation<br>
Haiming Chen, Ping Lu: Derivatives and Finite Automata of Expressions in Star Normal Form<br><br>
14:20 - 14:35 Break and Group Photo<br><br>
14:35 - 15:50<br><br>
Henk Don, Hans Zantema: Finding DFAs with Maximal Shortest Synchronizing Word Length<br>
Hellis Tamm, Brink Van Der Merwe: Lower Bound Methods for the Size of Nondeterministic Finite Automata Revisited<br>
Dusan Knop: Partitioning Graphs into Induced Subgraphs<br><br>
16:00 - 18:00 Touristic Visit<br><br>
---<br><br>
Wednesday, March 8<br><br>
09:00 - 09:50<br><br>
Franz Baader, Oliver Fernández Gil, Pavlos Marantidis: Approximation in Description Logics: How Weighted Tree Automata Can Help to Define the Required Concept Comparison Measures in FL0 - Invited Lecture<br><br>
09:50 - 10:20 Coffee Break<br><br>
10:20 - 11:35<br><br>
Nariyoshi Chida, Kimio Kuramitsu: Linear Parsing Expression Grammars<br>
Flavio D'Alessandro, Oscar H. Ibarra, Ian McQuillan: On Finite-Index Indexed Grammars and Their Restrictions<br>
Mark-Jan Nederhof, Anssi Yli-Jyrä: A Derivational Model of Discontinuous Parsing<br><br>
11:35 - 13:05 Lunch<br><br>
13:05 - 14:20<br><br>
Jirí Síma, Petr Savický: Cut Languages in Rational Bases<br>
Giovanni Casu, G. Michele Pinna: Merging Relations: a Way to Compact Petri Nets' Behaviors Uniformly<br>
Vidhya Ramaswamy, Jayalal Sarma, K. S. Sunil: Space Complexity of Reachability Testing in Labelled Graphs<br><br>
14:20 - 14:35 Break<br><br>
14:35 - 15:50<br><br>
Dick Grune, Wan Fokkink, Evangelos Chatzikalymnios, Brinio Hond, Peter Rutgers: Detecting Useless Transitions in Pushdown Automata<br>
Chunmiao Li, Xiaojuan Cai: Hardness Results for Coverability Problem of Well-Structured Pushdown Systems<br>
Adrien Pommellet, Marcio Diaz, Tayssir Touili: Reachability Analysis of Pushdown Systems with an Upper Stack<br><br>
---<br><br>
Thursday, March 9<br><br>
09:00 - 09:50<br><br>
Harald Beck, Minh Dao-Tran, Thomas Eiter: LARS Stream Reasoning and Temporal Logic - Invited Lecture<br><br>
09:50 - 10:20 Coffee Break<br><br>
10:20 - 11:10<br><br>
Davide Bresolin, Ivan Lanese: Most General Property-Preserving Updates<br>
Bernd Gärtner, Ahad Noori Zehmakan: Color War: Cellular Automata with Majority Rule<br><br>
11:10 - 11:25 Break<br><br>
11:25 - 12:15<br><br>
Stefan Gerdjikov, Stoyan Mihov: Over which Monoids is the Transducer Determinization Procedure Applicable?<br>
Mika Hirvensalo, Etienne Moutot and Abuzer Yakarylmaz: On the Computational Power of Affine Automata<br><br>
12:15 - 12:25 Closing<br><br>
12:25 - 13:55 Lunch</body></html>