*To be removed from our mailing list, please respond to this message with UNSUBSCRIBE in the subject line*
*************************************************************************
14th INTERNATIONAL CONFERENCE ON LANGUAGE AND AUTOMATA THEORY AND APPLICATIONS
LATA 2020
Milan, Italy
March 4-6, 2020
Co-organized by:
���� ��
Department of Informatics, Systems and Communication
University of Milano-Bicocca
and
Institute for Research Development, Training and Advice
Brussels/London
https://lata2020.irdta.eu
*************************************************************************
PROGRAM
Wednesday, March 4
09:00 - 09:30���� ��Registration
09:30 - 09:40���� ��Opening
09:40 - 10:30���� ��Eric Allender. The New Complexity Landscape around Circuit Minimization - Invited lecture
10:30 - 10:50���� ��Break
10:50 - 12:05
Dmitry Berdinsky and Prohrak Kruengthomya. Nonstandard Cayley Automatic Representations for Fundamental Groups of Torus Bundles over the Circle
Alexis Bes and Christian Choffrut. Deciding (R,+,<,1) in (R,+,<,Z)
Ziyuan Gao, Sanjay Jain, Ji Qi, Philipp Schlicht, Frank Stephan and Jacob Tarr. Ordered Semiautomatic Rings with Applications to Geometry
12:05 - 13:35���� ��Lunch
13:35 - 14:25���� ��Laure Daviaud. Containment and Equivalence of Weighted Automata: Probabilistic and Max-Plus Cases - Invited lecture
14:25 - 14:45���� ��Break
14:45 - 16:00
Siddharth Bhaskar, Jane Chandlee, Adam Jardine and Christopher Oakden. Boolean Monadic Recursive Schemes as a Logical Characterization of the Subsequential Functions
Susanna Donatelli and Serge Haddad. Expressiveness and Conciseness of Timed Automata for the Verification of Stochastic Models
Mehmet Utkan Gezer. Windable Heads & Recognizing NL with Constant Randomness
16:00 - 16:20���� ��Break
16:20 - 17:35
Chris Keeler and Kai Salomaa. Alternating Finite Automata with Limited Universal Branching
Nadia Labai, Tomer Kotek, Magdalena Ortiz and Helmut Veith. Pebble-intervals Automata and FO2 with Two Orders
Ahmet Bilal U��an. Limited Two-way Deterministic Finite Automata with Advice
17:35 - 19:35���� ��Touristic visit
---
Thursday, March 5
09:00 - 09:50���� ��Christoph Haase. Approaching Arithmetic Theories with Finite-state Automata - Invited lecture
09:50 - 10:10���� ��Break
10:10 - 11:25
Kazuyuki Amano. On the Size of Depth-two Threshold Circuits for the Inner Product mod 2 Function
Riccardo Dondi, Giancarlo Mauri and Italo Zoppis. Complexity Issues of String to Graph Approximate Matching
Hans Zantema. Complexity of Automatic Sequences
11:25 - 11:45���� ��Break and Group photo
11:45 - 12:35
Aaron Lye. Context-sensitive Fusion Grammars Are Universal
Alexander Okhotin and Alexey Sorokin. Cyclic Shift on Multi-component Grammars
12:35 - 14:05���� ��Lunch��
14:05 - 14:55���� ��Artur Jez. Recompression: Technique for Word Equations and Compressed Data - Invited lecture
14:55 - 15:15���� ��Break
15:15 - 16:30
Olivier Finkel. The Automatic Baire Property and an Effective Property of omega-Rational Functions
Nathan Grosshans. The Power of Programs over Monoids in J
Ondrej Kl��ma and Peter Kostol��nyi. Geometrically Closed Positive Varieties of Star-free Languages
16:30 - 16:50���� ��Break
16:50 - 18:05
Tomoyuki Yamakami. Intersection and Union Hierarchies of Deterministic Context-free Languages and Pumping Lemmas
Vikraman Arvind, Frank Fuhlbr��ck, Johannes Koebler and Oleg Verbitsky. On the Weisfeiler-Leman Dimension of Fractional Packing
Jing Ji and Jeffrey Heinz. Input Strictly Local Tree Transducers
18:05 - 19:15���� ��Reception
---
Friday, March 6
09:00 - 09:50���� ��Jean-��ric Pin. How to Prove that a Language is Regular or Star-free? - Invited lecture
09:50 - 10:10���� ��Break
10:10 - 11:25
Paola Bonizzoni, Clelia De Felice, Rocco Zaccagnino and Rosalba Zizza. Lyndon Words versus Inverse Lyndon Words: Queries on Suffixes and Bordered Words
Jeffery Dick, Laura Hutchinson, Robert Mercas and Daniel Reidenbach. Reducing the Ambiguity of Parikh Matrices
Pamela Fleischmann, Dirk Nowotka, Mitja Kulczynski and Danny B��gsted Poulsen. On Collapsing Prefix Normal Words
11:25 - 11:45���� ��Break
11:45 - 12:35
Aaron Moss. Simplified Parsing Expression Derivatives
Jean N��raud. Complete Variable-length Codes: An Excursion into Word Edit Operations
12:35 - 14:05���� ��Lunch
14:05 - 14:55���� ��Thomas Place. Deciding Classes of Regular Languages: The Covering Approach - Invited lecture
14:55 - 15:05���� ��Closing