[ecoop-info] LATA 2018: call for participation

IRDTA irdta at irdta.eu
Sat Mar 10 06:18:13 CET 2018

LATA 2018: call for participation*To be removed from our mailing list, please respond to this message with UNSUBSCRIBE in the subject line*



LATA 2018

Bar-Ilan near Tel Aviv, Israel

April 9-11, 2018

Organized by:


Department of Computer Science

Bar-Ilan University

Research Group on Mathematical Linguistics (GRLMC)

Rovira i Virgili University




Monday, April 9

09:00 - 09:30    Registration

09:30 - 09:40    Opening

09:40 - 10:30    Andrei Bulatov. Constraint Satisfaction Problems and Their Complexity - Invited lecture

10:30 - 11:00    Coffee break

11:00 - 12:15

Ekaterina Bakinova, Artem Basharin, Igor Batmanov, Konstantin Lyubort, Alexander Okhotin and Elizaveta Sazhneva. Formal Languages over GF(2)

Laura Bozzelli, Adriano Peron and Aniello Murano. Event-clock Nested Automata

J. Andres Montoya and Christian Nolasco. On the Synchronization of Planar Automata

12:15 - 13:45    Lunch

13:45 - 14:35    Markus Lohrey. Streaming Algorithms in Formal Language Theory - Invited lecture

14:35 - 14:50    Break

14:50 - 16:05

Maris Valdats. Descriptional and Computational Complexity of the Circuit Representation of Finite Automata

Alexey Zhirabok and Alexey Shumsky. Disturbance Decoupling in Finite Automata

Johannes K. Fichte, Markus Hecher and Irina Schindler. Default Logic and Bounded Treewidth

16:05 - 16:20    Break

16:20 - 17:10

Stefan Gerdjikov. A General Class of Monoids Supporting Canonisation and Minimisation of (Sub)sequential Transducers

Demen Güler, Andreas Krebs, Klaus-Joern Lange and Petra Wolf. Deciding Regular Intersection Emptiness of Complete Problems for PSPACE and the Polynomial Hierarchy


Tuesday, April 10

09:00 - 09:50    Alexander Okhotin. Underlying Principles and Recurring Ideas of Formal Grammars - Invited lecture

09:50 - 10:20    Coffee break

10:20 - 11:35

Sanjay Jain, Eric Martin and Frank Stephan. Transduced Learners

Rick Smetsers, Paul Fiterau-Brostean and Frits Vaandrager. Model Learning as a Satisfiability Modulo Theories Problem

Andrei Asinowski, Axel Bacher, Cyril Banderier and Bernhard Gittenberger. Analytic Combinatorics of Lattice Paths with Forbidden Patterns: Enumerative Aspects

11:35 - 11:50    Break and Group photo

11:50 - 13:05

Ferdinando Cicalese, Zsuzsanna Liptak and Massimiliano Rossi. Bubble-Flip - A New Generation Algorithm for Prefix Normal Words

Murray Elder and Yoong Kuan Goh. Permutations Sorted by a Finite and an Infinite Stack in Series

Tomasz Kociumaka, Jakub Radoszewski, Wojciech Rytter and Tomasz Walen. On Periodicity Lemma for Partial Words

13:05 -    14:35    Lunch

14:35 - 15:25    Eli Shamir. Reshaping the Context-free Model: Linguistic and Algorithmic Aspects - Invited lecture

15:30 -     Visit to Jerusalem


Wednesday, April 11

09:00 - 09:50    James Worrell. Invariants for Linear Loops - Invited lecture

09:50 - 10:20    Coffee break

10:20 - 11:35

Dmitry Berdinsky and Phongpitak Trakuldit. Measuring Closeness between Cayley Automatic Groups and Automatic Groups

Thomas Chatain, Maurice Comlan, David Delfieu, Loig Jezequel and Olivier H. Roux. Pomsets and Unfolding of Reset Petri Nets

Mathias Ruggaard Pedersen, Nathanaël Fijalkow, Giorgio Bacci, Kim Guldstrand Larsen and Radu Mardare. Timed Comparisons of Semi-Markov Processes

11:35 - 11:50    Break

11:50 - 13:05

Markus Saers and Dekai Wu. Handling Ties Correctly and Efficiently in Viterbi Training Using the Viterbi Semiring

Uli Schlachter. Over-approximative Petri Net Synthesis for Restricted Subclasses of Nets

Christoph Teichmann, Antoine Venant and Alexander Koller. Efficient Translation with Linear Bimorphisms

13:05 - 13:15    Closing

13:15 -        Lunch

More information about the ecoop-info mailing list