From mboxrd@z Thu Jan 1 00:00:00 1970 Return-Path: X-Original-To: caml-list@sympa.inria.fr Delivered-To: caml-list@sympa.inria.fr Received: from mail3-relais-sop.national.inria.fr (mail3-relais-sop.national.inria.fr [192.134.164.104]) by sympa.inria.fr (Postfix) with ESMTPS id 9A3CA7F6CC for ; Sat, 7 Feb 2015 08:24:33 +0100 (CET) Received-SPF: None (mail3-smtp-sop.national.inria.fr: no sender authenticity information available from domain of grlmc@urv.cat) identity=pra; client-ip=193.144.16.76; receiver=mail3-smtp-sop.national.inria.fr; envelope-from="grlmc@urv.cat"; x-sender="grlmc@urv.cat"; x-conformance=sidf_compatible Received-SPF: Pass (mail3-smtp-sop.national.inria.fr: domain of grlmc@urv.cat designates 193.144.16.76 as permitted sender) identity=mailfrom; client-ip=193.144.16.76; receiver=mail3-smtp-sop.national.inria.fr; envelope-from="grlmc@urv.cat"; x-sender="grlmc@urv.cat"; x-conformance=sidf_compatible; x-record-type="v=spf1" Received-SPF: None (mail3-smtp-sop.national.inria.fr: no sender authenticity information available from domain of postmaster@mta04.urv.cat) identity=helo; client-ip=193.144.16.76; receiver=mail3-smtp-sop.national.inria.fr; envelope-from="grlmc@urv.cat"; x-sender="postmaster@mta04.urv.cat"; x-conformance=sidf_compatible X-IronPort-Anti-Spam-Filtered: true X-IronPort-Anti-Spam-Result: A0BOAwCNvNVUnEwQkMFag1hOAQEKgjtHrT+SKwaFcQICAoERQwEBAQEBARABAQEBAQgLCQkULoQTCAQRBisHEwUBBBQFBxIKAgUhAhsGEgIlAQQbAxIEiBABCKAQjSSPSJZTgSGIbTKCCIJ/gmUMLxEdgRMFjSeBcwRyglqCEYRiNoJNgw+LQ4FnDAGCHW6CQgEBAQ X-IPAS-Result: A0BOAwCNvNVUnEwQkMFag1hOAQEKgjtHrT+SKwaFcQICAoERQwEBAQEBARABAQEBAQgLCQkULoQTCAQRBisHEwUBBBQFBxIKAgUhAhsGEgIlAQQbAxIEiBABCKAQjSSPSJZTgSGIbTKCCIJ/gmUMLxEdgRMFjSeBcwRyglqCEYRiNoJNgw+LQ4FnDAGCHW6CQgEBAQ X-IronPort-AV: E=Sophos;i="5.09,534,1418079600"; d="scan'208";a="99197927" Received: from mta04.urv.cat ([193.144.16.76]) by mail3-smtp-sop.national.inria.fr with ESMTP; 07 Feb 2015 08:24:32 +0100 X-IronPort-AV: E=Sophos;i="5.09,534,1418079600"; d="scan'208";a="58851019" Received: from pmbox2.urv.cat ([193.144.16.41]) by mta.urv.cat with ESMTP; 07 Feb 2015 08:24:32 +0100 Received: from Carlos1 (unknown [46.26.11.86]) (using TLSv1 with cipher AES128-SHA (128/128 bits)) (No client certificate requested) by pmbox2.urv.cat (Postfix) with ESMTPSA id 2717415B40; Sat, 7 Feb 2015 08:24:24 +0100 (CET) From: "GRLMC" To: "GRLMC" Date: Sat, 7 Feb 2015 08:24:33 +0100 Message-ID: <484736AE4BA14E3B97AF3644965C3EAC@Carlos1> MIME-Version: 1.0 Content-Type: text/plain; charset="utf-8" Content-Transfer-Encoding: quoted-printable X-Mailer: Microsoft Office Outlook 11 X-MIMEOLE: Produced By Microsoft MimeOLE V6.0.6000.16669 Thread-index: AdBCpx7KIJHhb6oTQaGYPBdlscMQEg== X-Antivirus: avast! (VPS 150205-1, 05/02/2015), Outbound message X-Antivirus-Status: Clean X-Validation-by: grlmc@urv.cat Subject: [Caml-list] LATA 2015: call for participation *To be removed from our mailing list, please respond to this message with U= NSUBSCRIBE in the subject line* ***************************************************************************= ** 9th INTERNATIONAL CONFERENCE ON LANGUAGE AND AUTOMATA THEORY AND APPLICATIO= NS LATA 2015 Nice, France March 2-6, 2015 Organized by: CNRS, I3S, UMR 7271 Nice Sophia Antipolis University Research Group on Mathematical Linguistics (GRLMC) Rovira i Virgili University http://grammars.grlmc.com/lata2015/ ***************************************************************************= ** PROGRAM Monday, March 2 09:15 - 10:15 Registration 10:15 - 10:25 Opening 10:25 - 11:15 Azadeh Farzan, Matthias Heizmann, Jochen Hoenicke, Zachary Ki= ncaid and Andreas Podelski: Automated Program Verification - Invited Lecture 11:15 - 11:45 Coffee Break 11:45 - 13:00 Ala Eddine Ben Salem: Single-pass Testing Automata for LTL Model Checking Conrad Cotton-Barratt, Andrzej S. Murawski and C.-H. Luke Ong: Weak and Nes= ted Class Memory Automata Joey Eremondi, Oscar H. Ibarra and Ian McQuillan: Insertion Operations on D= eterministic Reversal-Bounded Counter Machines 13:00 - 14:30 Lunch 14:30 - 16:10 Adrien Boiret, Vincent Hugot, Joachim Niehren and Ralf Treinen: Logics for = Unordered Trees with Data Constraints on Siblings Fran=C3=A7ois Gonze and Rapha=C3=ABl M. Jungers: On the Synchronizing Proba= bility Function and the Triple Rendezvous Time: New Approaches to Cerny's C= onjecture Vesa Halava, Reino Niskanen and Igor Potapov: On Robot Games of Degree Two Shankara Narayanan Krishna, Lakshmi Manasa and Ashutosh Trivedi: Time-Bound= ed Reachability Problem for Recursive Timed Automata is Undecidable 16:10 - 16:25 Break 16:25 - 18:10 Rui Li and Yiguang Hong: On Observability of Automata Networks via Computat= ional Algebra Nicolas Peltier: Reasoning on Schemas of Formulas: An Automata-Based Approa= ch Martin Sulzmann and Peter Thiemann: Derivatives for Regular Shuffle Express= ions Eric Allender and Ian Mertz: Complexity of Regular Functions Tuesday, March 3 09:00 - 09:50 Marco Autili, Paola Inverardi, Filippo Mignosi, Romina Spalazzese and Massi= mo Tivoli: Automated Synthesis of Application-layer Connectors from Automat= a-based Specifications - Invited Lecture 09:50 - 10:05 Break 10:05 - 11:20 Peter Thiemann and Martin Sulzmann: From Omega-Regular Expressions to B=C3= =BCchi Automata via Partial Derivatives Guillaume Verdier and Jean-Baptiste Raclet: Quotient of Acceptance Specific= ations under Reachability Constraints Parvaneh Babari and Manfred Droste: A Nivat Theorem for Weighted Picture Au= tomata and Weighted MSO Logics 11:20 - 11:50 Coffee Break 11:50 - 13:05 Luc Boasson and Olivier Carton: Rational Selecting Relations and Selectors Peter Leupold and Norbert Hundeshagen: A Hierarchy of Transducing Observer = Systems Antoine Ndione, Aur=C3=A9lien Lemay and Joachim Niehren: Sublinear DTD Vali= dity 13:05 - 14:35 Lunch 14:35 - 16:15 Carl Barton, Costas S. Iliopoulos and Solon P. Pissis: Average-case Optimal= Approximate Circular String Matching Johanna Bj=C3=B6rklund, Frank Drewes and Niklas Zechner: An Efficient Best-= Trees Algorithm for Weighted Tree Automata over the Tropical Semiring Bastien Cazaux, Thierry Lecroq and Eric Rivals: Construction of a de Bruijn= Graph for Assembly from a Truncated Suffix Tree Da-Jung Cho, Yo-Sub Han and Hwee Kim: Frequent Pattern Mining with Non-over= lapping Inversions 16:15 - 16:30 Break 16:30 - 17:45 H.K. Dai and Z. Wang: A Parallel Algorithm for Finding All Minimal Maximum = Subsequences via Random Walk Hern=C3=A1n Ponce-De-Le=C3=B3n and Andrey Mokhov: Building Bridges Between = Sets of Partial Orders Vojt=C4=9Bch Vorel and Adam Roman: Complexity of Road Coloring with Prescri= bed Reset Words Wednesday, March 4 9:00 - 9:50 Antonio Restivo: The Shuffle Product: New Research Directions - Invited Lec= ture 9:50 - 10:05 Break 10:05 - 11:20 Marcella Anselmo, Dora Giammarresi and Maria Madonia: Structure and Measure= of a Decidable Class of Two-dimensional Codes Thibault Godin, Ines Klimann and Matthieu Picantin: On Torsion-Free Semigro= ups Generated by Invertible Reversible Mealy Automata Luis-Miguel Lopez and Philippe Narbel: Coding Non-orientable Laminations 11:20 - 11:50 Group Photo and Coffee Break 11:50 - 13:05 Pavel Panteleev: Preset Distinguishing Sequences and Diameter of Transforma= tion Semigroups Charalampos Zinoviadis: Hierarchy and Expansiveness in 2D Subshifts of Fini= te Type Stefano Bilotta, Elisa Pergola, Renzo Pinzani and Simone Rinaldi: Recurrenc= e Relations, Succession Rules and the Positivity Problem 13:05 - 14:35 Lunch 14:35 - 16:15 Philip Bille, Inge Li G=C3=B8rtz and S=C3=B8ren Vind: Compressed Data Struc= tures for Range Searching Alberto Policriti, Nicola Gigante and Nicola Prezza: Average Linear Time an= d Compressed Space Construction of the Burrows-Wheeler Transform Jan Tr=C3=A1vn=C3=AD=C4=8Dek, Jan Janou=C5=A1ek, Bo=C5=99ivoj Melichar and = Loek Cleophas: Backward Linearised Tree Pattern Matching Vladimir Ulyantsev, Ilya Zakirzyanov and Anatoly Shalyto: BFS-based Symmetr= y Breaking Predicates for DFA Identification 17:00 - 20:00 Touristic visit Thursday, March 5 09:00 - 09:50 Giancarlo Mauri, Alberto Leporati, Luca Manzoni, Antonio E. Porreca and Cla= udio Zandron: Complexity Classes for Membrane Systems - Invited Lecture 09:50 - 10:05 Break 10:05 - 11:20 Davide Bresolin, Dario Della Monica, Angelo Montanari, Pietro Sala and Guid= o Sciavicco: On the Complexity of Fragments of the Modal Logic of Allen's R= elations over Dense Structures Nadia Creignou, Ra=C3=AFda Ktari, Arne Meier, Julian-Steffen M=C3=BCller, F= r=C3=A9d=C3=A9ric Olive and Heribert Vollmer: Parameterized Enumeration for= Modification Problems Martin L=C3=BCck, Arne Meier and Irena Schindler: Parameterized Complexity = of CTL: A Generalization of Courcelle's Theorem 11:20 - 11:50 Coffee Break 11:50 - 13:05 Kazuyuki Amano and Atsushi Saito: A Nonuniform Circuit Class with Multilaye= r of Threshold Gates Having Super Quasi Polynomial Size Lower Bounds agains= t NEXP Georg Bachmeier, Michael Luttenberger and Maximilian Schlund: Finite Automa= ta for the Sub- and Superword Closure of CFLs: Descriptional and Computatio= nal Complexity Olaf Beyersdorff, Leroy Chew and Karteek Sreenivasaiah: A Game Characterisa= tion of Tree-like Q-resolution Size 13:05 - 14:35 Lunch 14:35 - 16:15 Alberto Dennunzio, Enrico Formenti, Luca Manzoni and Antonio E. Porreca: Pr= eimage Problems for Reaction Systems Ryo Yoshinaka: Learning Conjunctive Grammars and Contextual Binary Feature = Grammars Rapha=C3=ABl Bailly, Fran=C3=A7ois Denis and Guillaume Rabusseau: Recogniza= ble Series on Hypergraphs Yohan Boichut, Jacques Chabin and Pierre R=C3=A9ty: Towards More Precise Re= writing Approximations 16:15 - 16:30 Break 16:30 - 17:45 Michael Codish, Lu=C3=ADs Cruz-Filipe and Peter Schneider-Kamp: Sorting Net= works: the End Game Konrad Kazimierz Dabrowski, Shenwei Huang and Dani=C3=ABl Paulusma: Boundin= g Clique-width via Perfect Graphs Ryszard Janicki, Jetty Kleijn, Maciej Koutny and =C5=81ukasz Mikulski: Orde= r Structures for Subclasses of Generalised Traces Friday, March 6 9:00 - 9:50 Johann A. Makowsky and Nadia Labai: Hankel Matrices: From Words to Graphs -= Invited Lecture 9:50 - 10:05 Break 10:05 - 11:20 Golnaz Badkobeh, Gabriele Fici and Zsuzsanna Lipt=C3=A1k: On the Number of = Closed Factors in a Word Gabriele Fici, Thierry Lecroq, Arnaud Lefebvre and =C3=89lise Prieur-Gaston= : Online Computation of Abelian Runs Guilhem Gamard and Gwena=C3=ABl Richomme: Coverability in Two Dimensions 11:20 - 11:50 Coffee Break 11:50 - 13:05 Jana Hadravov=C3=A1 and =C5=A0t=C4=9Bp=C3=A1n Holub: Equation xiyjxk=3Duivj= uk in Words =C5=81ukasz Mikulski, Marcin Pi=C4=85tkowski and Wojciech Rytter: Square-fr= ee Words over Partially Commutative Alphabets Ananda Chandra Nayak and Kalpesh Kapoor: On the Language of Primitive Parti= al Words 13:05 - 13:15 Closing --- Este mensaje no contiene virus ni malware porque la protecci=C3=B3n de avas= t! Antivirus est=C3=A1 activa. http://www.avast.com