ACM SIGCHI General Interest Announcements (Mailing List)


Options: Use Forum View

Use Monospaced Font
Show Text Part by Default
Show All Mail Headers

Message: [<< First] [< Prev] [Next >] [Last >>]
Topic: [<< First] [< Prev] [Next >] [Last >>]
Author: [<< First] [< Prev] [Next >] [Last >>]

Print Reply
Reply To:
Fri, 15 Feb 2019 03:03:32 +0100
text/plain (259 lines)

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



LATA 2019

Saint Petersburg, Russia

March 26-29, 2019

Organized by:


Saint Petersburg State University


Institute for Research Development, Training and Advice, Brussels/London



Tuesday, March 26

09:00 - 09:30    Registration

09:30 - 09:40    Opening

09:40 - 10:30    Edward A. Lee. Observation and Interaction - Invited lecture

10:30 - 11:00    Break

11:00 - 12:15

Malek Anabtawi, Sabit Hassan, Christos Kapoutsis and Mohammad Zakzok. An Oracle Hierarchy for Small One-way Finite Automata

Tim Becker and Klaus Sutner. Orbits of Abelian Automaton Groups

Alex Bishop and Murray Elder. Bounded Automata Groups Are co-ET0L

12:15 - 13:45    Lunch

13:45 - 15:00

Alberto Dennunzio, Enrico Formenti, Luca Manzoni, Luciano Margara and Antonio E. Porreca. Decidability of Sensitivity and Equicontinuity for Linear Higher-order Cellular Automata

Ondrej Klíma and Libor Polak. On Varieties of Ordered Automata

Klaus Meer and Ameen Naif. Automata over Infinite Sequences of Reals

15:00 - 15:30    Break

15:30 - 17:10

Tomoyuki Yamakami. Non-uniform State Complexity of Quantum Finite Automata and Quantum Polynomial-time Logarithmic-space Computation with Quantum Advice

Vladimir Zakharov. Equivalence Checking of Prefix-free Transducers and Deterministic Two-tape Automata

Ilya Zakirzyanov, Antonio Morgado, Alexey Ignatiev, Vladimir Ulyantsev and Joao Marques-Silva. Efficient Symmetry Breaking for SAT-based Minimum DFA Inference

Jackson Abascal, Lane A. Hemaspaandra, Shir Maimon and Daniel Rubery. Closure and Nonclosure Properties of the Compressible and Rankable Sets


Wednesday, March 27

09:00 - 09:50    Henning Fernau. Modern Aspects of Complexity within Formal Languages - Invited lecture

09:50 - 10:20    Break

10:20 - 11:35

Markus Holzer and Michal Hospodár. The Range of State Complexities of Languages Resulting from the Cut Operation

Lila Kari and Timothy Ng. State Complexity of Pseudocatenation

Daniel Padé and Stephen Fenner. Complexity of (R,C)-crosswords

11:35 - 12:05    Break and Group photo

12:05 - 13:20

Berthold Hoffmann and Mark Minas. Generalized Predictive Shift-reduce Parsing for Hyperedge Replacement Graph Grammars

Hans-Joerg Kreowski, Sabine Kuske and Aaron Lye. Transformation of Petri Nets into Context-dependent Fusion Grammars

Ryoma Senda, Yoshiaki Takata and Hiroyuki Seki. Generalized Register Context-free Grammars

13:20 -    14:50    Lunch

15:00        Touristic visit


Thursday, March 28

09:00 - 09:50    Pawel Gawrychowski. Searching and Indexing Compressed Text - Invited lecture

09:50 - 10:20    Break

10:20 - 11:35

Amazigh Amrane and Nicolas Bedon. Logic and Rational Languages of Scattered and Countable Series-parallel Posets

Marcella Anselmo, Maria Madonia and Carla Selmi. Toroidal Codes and Conjugate Pictures

Jean-Philippe Dubernard, Giovanna Guaiana and Ludovic Mignot. Geometrical Closure of Binary V3/2 Languages

11:35 - 12:05    Break

12:05 - 13:20

Galina Jirásková and Ondrej Klíma. Deterministic Biautomata and Subclasses of Deterministic Linear Languages

Alexis Linard, Colin de la Higuera and Frits Vaandrager. Learning Unions of k-Testable Languages

Iovka Boneva, Joachim Niehren and Momar Sakho. Regular Matching and Inclusion on Compressed Tree Patterns with Context Variables

13:20 -    14:50    Lunch

14:50 - 15:40    Vadim Lozin. From Words to Graphs, and back - Invited lecture

15:40 - 16:10    Break

16:10 - 17:25

Ajay K. Eeralla, Serdar Erbatur, Andrew M. Marshall and Christophe Ringeissen. Rule-based Unification in Combined Theories and the Finite Variant Property

Pawel Parys. Extensions of the Caucal Hierarchy?

Ahad N. Zehmakan. Tight Bounds on the Minimum Size of a Dynamic Monopoly


Friday, March 29

09:00 - 09:50    Esko Ukkonen. Pattern Discovery in Biological Sequences - Invited lecture

09:50 - 10:20    Break

10:20 - 11:35

Emilie Charlier, Svetlana Puzynina and Elise Vandomme. Recurrence in Multidimensional Words

Christophe Cordero. A Note with Computer Exploration of the Triangle Conjecture

Tomasz Kociumaka, Jakub Radoszewski, Wojciech Rytter, Juliusz Straszynski, Tomasz Walen and Wiktor Zuba. Efficient Representation and Counting of Antipower Factors in Words

11:35 - 12:05    Break

12:05 - 13:20

Kalpana Mahalingam and Palak Pandoh. On the Maximum Number of Distinct Palindromic Sub-arrays

Wojciech Rytter and Wiktor Zuba. Syntactic View of Sigma-Tau Generation of Permutations

Andrew Ryzhikov and Clemens Mullner. Palindromic Subsequences in Finite Words

13:20 - 13:30    Closing

13:30 -    15:00    Lunch


    For news of CHI books, courses & software, join CHI-RESOURCES
     mailto: [log in to unmask]

    To unsubscribe from CHI-ANNOUNCEMENTS send an email to
     mailto:[log in to unmask]

    For further details of CHI lists see