<!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 2018: call for participation</title></head><body>*To be removed from our mailing list, please respond to this message with UNSUBSCRIBE in the subject line*<br><br>
************************************************************************<br>
12th INTERNATIONAL CONFERENCE ON LANGUAGE AND AUTOMATA THEORY AND APPLICATIONS<br><br>
LATA 2018<br><br>
Bar-Ilan near Tel Aviv, Israel<br><br>
April 9-11, 2018<br><br>
Organized by:<br>
<br>
Department of Computer Science<br>
Bar-Ilan University<br><br>
Research Group on Mathematical Linguistics (GRLMC)<br>
Rovira i Virgili University<br><br>
http://grammars.grlmc.com/LATA2018/<br>
************************************************************************<br><br>
PROGRAM<br><br>
Monday, April 9<br><br>
09:00 - 09:30 Registration<br><br>
09:30 - 09:40 Opening<br><br>
09:40 - 10:30 Andrei Bulatov. Constraint Satisfaction Problems and Their Complexity - Invited lecture<br><br>
10:30 - 11:00 Coffee break<br><br>
11:00 - 12:15<br><br>
Ekaterina Bakinova, Artem Basharin, Igor Batmanov, Konstantin Lyubort, Alexander Okhotin and Elizaveta Sazhneva. Formal Languages over GF(2)<br><br>
Laura Bozzelli, Adriano Peron and Aniello Murano. Event-clock Nested Automata<br><br>
J. Andres Montoya and Christian Nolasco. On the Synchronization of Planar Automata<br><br>
12:15 - 13:45 Lunch<br><br>
13:45 - 14:35 Markus Lohrey. Streaming Algorithms in Formal Language Theory - Invited lecture<br><br>
14:35 - 14:50 Break<br><br>
14:50 - 16:05<br><br>
Maris Valdats. Descriptional and Computational Complexity of the Circuit Representation of Finite Automata<br><br>
Alexey Zhirabok and Alexey Shumsky. Disturbance Decoupling in Finite Automata<br><br>
Johannes K. Fichte, Markus Hecher and Irina Schindler. Default Logic and Bounded Treewidth<br><br>
16:05 - 16:20 Break<br><br>
16:20 - 17:10<br><br>
Stefan Gerdjikov. A General Class of Monoids Supporting Canonisation and Minimisation of (Sub)sequential Transducers<br><br>
Demen Güler, Andreas Krebs, Klaus-Joern Lange and Petra Wolf. Deciding Regular Intersection Emptiness of Complete Problems for PSPACE and the Polynomial Hierarchy<br><br>
---<br><br>
Tuesday, April 10<br><br>
09:00 - 09:50 Alexander Okhotin. Underlying Principles and Recurring Ideas of Formal Grammars - Invited lecture<br><br>
09:50 - 10:20 Coffee break<br><br>
10:20 - 11:35<br><br>
Sanjay Jain, Eric Martin and Frank Stephan. Transduced Learners<br><br>
Rick Smetsers, Paul Fiterau-Brostean and Frits Vaandrager. Model Learning as a Satisfiability Modulo Theories Problem<br><br>
Andrei Asinowski, Axel Bacher, Cyril Banderier and Bernhard Gittenberger. Analytic Combinatorics of Lattice Paths with Forbidden Patterns: Enumerative Aspects<br><br>
11:35 - 11:50 Break and Group photo<br><br>
11:50 - 13:05<br><br>
Ferdinando Cicalese, Zsuzsanna Liptak and Massimiliano Rossi. Bubble-Flip - A New Generation Algorithm for Prefix Normal Words<br><br>
Murray Elder and Yoong Kuan Goh. Permutations Sorted by a Finite and an Infinite Stack in Series<br><br>
Tomasz Kociumaka, Jakub Radoszewski, Wojciech Rytter and Tomasz Walen. On Periodicity Lemma for Partial Words<br><br>
13:05 - 14:35 Lunch<br><br>
14:35 - 15:25 Eli Shamir. Reshaping the Context-free Model: Linguistic and Algorithmic Aspects - Invited lecture<br><br>
15:30 - Visit to Jerusalem<br><br>
---<br><br>
Wednesday, April 11<br><br>
09:00 - 09:50 James Worrell. Invariants for Linear Loops - Invited lecture<br><br>
09:50 - 10:20 Coffee break<br><br>
10:20 - 11:35<br><br>
Dmitry Berdinsky and Phongpitak Trakuldit. Measuring Closeness between Cayley Automatic Groups and Automatic Groups<br><br>
Thomas Chatain, Maurice Comlan, David Delfieu, Loig Jezequel and Olivier H. Roux. Pomsets and Unfolding of Reset Petri Nets<br><br>
Mathias Ruggaard Pedersen, Nathanaël Fijalkow, Giorgio Bacci, Kim Guldstrand Larsen and Radu Mardare. Timed Comparisons of Semi-Markov Processes<br><br>
11:35 - 11:50 Break<br><br>
11:50 - 13:05<br><br>
Markus Saers and Dekai Wu. Handling Ties Correctly and Efficiently in Viterbi Training Using the Viterbi Semiring<br><br>
Uli Schlachter. Over-approximative Petri Net Synthesis for Restricted Subclasses of Nets<br><br>
Christoph Teichmann, Antoine Venant and Alexander Koller. Efficient Translation with Linear Bimorphisms<br><br>
13:05 - 13:15 Closing<br><br>
13:15 - Lunch</body></html>