<!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 2019: 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>
13th INTERNATIONAL CONFERENCE ON LANGUAGE AND AUTOMATA THEORY AND APPLICATIONS<br><br>
LATA 2019<br><br>
Saint Petersburg, Russia<br><br>
March 26-29, 2019<br><br>
Organized by:<br>
<br>
Saint Petersburg State University<br>
and<br>
Institute for Research Development, Training and Advice, Brussels/London<br><br>
http://lata2019.irdta.eu/<br>
*************************************************************************<br><br>
PROGRAM<br><br>
Tuesday, March 26<br><br>
09:00 - 09:30 Registration<br><br>
09:30 - 09:40 Opening<br><br>
09:40 - 10:30 Edward A. Lee. Observation and Interaction - Invited lecture<br><br>
10:30 - 11:00 Break<br><br>
11:00 - 12:15<br><br>
Malek Anabtawi, Sabit Hassan, Christos Kapoutsis and Mohammad Zakzok. An Oracle Hierarchy for Small One-way Finite Automata<br><br>
Tim Becker and Klaus Sutner. Orbits of Abelian Automaton Groups<br><br>
Alex Bishop and Murray Elder. Bounded Automata Groups Are co-ET0L<br><br>
12:15 - 13:45 Lunch<br><br>
13:45 - 15:00<br><br>
Alberto Dennunzio, Enrico Formenti, Luca Manzoni, Luciano Margara and Antonio E. Porreca. Decidability of Sensitivity and Equicontinuity for Linear Higher-order Cellular Automata<br><br>
Ondrej Klíma and Libor Polak. On Varieties of Ordered Automata<br><br>
Klaus Meer and Ameen Naif. Automata over Infinite Sequences of Reals<br><br>
15:00 - 15:30 Break<br><br>
15:30 - 17:10<br><br>
Tomoyuki Yamakami. Non-uniform State Complexity of Quantum Finite Automata and Quantum Polynomial-time Logarithmic-space Computation with Quantum Advice<br><br>
Vladimir Zakharov. Equivalence Checking of Prefix-free Transducers and Deterministic Two-tape Automata<br><br>
Ilya Zakirzyanov, Antonio Morgado, Alexey Ignatiev, Vladimir Ulyantsev and Joao Marques-Silva. Efficient Symmetry Breaking for SAT-based Minimum DFA Inference<br><br>
Jackson Abascal, Lane A. Hemaspaandra, Shir Maimon and Daniel Rubery. Closure and Nonclosure Properties of the Compressible and Rankable Sets<br><br>
---<br><br>
Wednesday, March 27<br><br>
09:00 - 09:50 Henning Fernau. Modern Aspects of Complexity within Formal Languages - Invited lecture<br><br>
09:50 - 10:20 Break<br><br>
10:20 - 11:35<br><br>
Markus Holzer and Michal Hospodár. The Range of State Complexities of Languages Resulting from the Cut Operation<br><br>
Lila Kari and Timothy Ng. State Complexity of Pseudocatenation<br><br>
Daniel Padé and Stephen Fenner. Complexity of (R,C)-crosswords<br><br>
11:35 - 12:05 Break and Group photo<br><br>
12:05 - 13:20<br><br>
Berthold Hoffmann and Mark Minas. Generalized Predictive Shift-reduce Parsing for Hyperedge Replacement Graph Grammars<br><br>
Hans-Joerg Kreowski, Sabine Kuske and Aaron Lye. Transformation of Petri Nets into Context-dependent Fusion Grammars<br><br>
Ryoma Senda, Yoshiaki Takata and Hiroyuki Seki. Generalized Register Context-free Grammars<br><br>
13:20 - 14:50 Lunch<br><br>
15:00 Touristic visit<br><br>
---<br><br>
Thursday, March 28<br><br>
09:00 - 09:50 Pawel Gawrychowski. Searching and Indexing Compressed Text - Invited lecture<br><br>
09:50 - 10:20 Break<br><br>
10:20 - 11:35<br><br>
Amazigh Amrane and Nicolas Bedon. Logic and Rational Languages of Scattered and Countable Series-parallel Posets<br><br>
Marcella Anselmo, Maria Madonia and Carla Selmi. Toroidal Codes and Conjugate Pictures<br><br>
Jean-Philippe Dubernard, Giovanna Guaiana and Ludovic Mignot. Geometrical Closure of Binary V3/2 Languages<br><br>
11:35 - 12:05 Break<br><br>
12:05 - 13:20<br><br>
Galina Jirásková and Ondrej Klíma. Deterministic Biautomata and Subclasses of Deterministic Linear Languages<br><br>
Alexis Linard, Colin de la Higuera and Frits Vaandrager. Learning Unions of k-Testable Languages<br><br>
Iovka Boneva, Joachim Niehren and Momar Sakho. Regular Matching and Inclusion on Compressed Tree Patterns with Context Variables<br><br>
13:20 - 14:50 Lunch<br><br>
14:50 - 15:40 Vadim Lozin. From Words to Graphs, and back - Invited lecture<br><br>
15:40 - 16:10 Break<br><br>
16:10 - 17:25<br><br>
Ajay K. Eeralla, Serdar Erbatur, Andrew M. Marshall and Christophe Ringeissen. Rule-based Unification in Combined Theories and the Finite Variant Property<br><br>
Pawel Parys. Extensions of the Caucal Hierarchy?<br><br>
Ahad N. Zehmakan. Tight Bounds on the Minimum Size of a Dynamic Monopoly<br><br>
---<br><br>
Friday, March 29<br><br>
09:00 - 09:50 Esko Ukkonen. Pattern Discovery in Biological Sequences - Invited lecture<br><br>
09:50 - 10:20 Break<br><br>
10:20 - 11:35<br><br>
Emilie Charlier, Svetlana Puzynina and Elise Vandomme. Recurrence in Multidimensional Words<br><br>
Christophe Cordero. A Note with Computer Exploration of the Triangle Conjecture<br><br>
Tomasz Kociumaka, Jakub Radoszewski, Wojciech Rytter, Juliusz Straszynski, Tomasz Walen and Wiktor Zuba. Efficient Representation and Counting of Antipower Factors in Words<br><br>
11:35 - 12:05 Break<br><br>
12:05 - 13:20<br><br>
Kalpana Mahalingam and Palak Pandoh. On the Maximum Number of Distinct Palindromic Sub-arrays<br><br>
Wojciech Rytter and Wiktor Zuba. Syntactic View of Sigma-Tau Generation of Permutations<br><br>
Andrew Ryzhikov and Clemens Mullner. Palindromic Subsequences in Finite Words<br><br>
13:20 - 13:30 Closing<br><br>
13:30 - 15:00 Lunch<br>
</body></html>