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