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 D91DF7EE49 for ; Sun, 24 Feb 2013 12:57:57 +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.78; 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.78 as permitted sender) identity=mailfrom; client-ip=193.144.16.78; 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@mta01.urv.cat) identity=helo; client-ip=193.144.16.78; receiver=mail3-smtp-sop.national.inria.fr; envelope-from="grlmc@urv.cat"; x-sender="postmaster@mta01.urv.cat"; x-conformance=sidf_compatible X-IronPort-Anti-Spam-Filtered: true X-IronPort-Anti-Spam-Result: Au4CAAT/KVHBkBBOcGdsb2JhbABFhk+7AIEIFg4BDAgOBxQFIoIhBQgVBisaBQEYBQccAgUhAhsGEgIlAQQbAxIEh3YIkV6MLo5VhEiMdYEjjCRmMIJlMmEDi2aBal+ETYRehUmNB4Fo X-IPAS-Result: Au4CAAT/KVHBkBBOcGdsb2JhbABFhk+7AIEIFg4BDAgOBxQFIoIhBQgVBisaBQEYBQccAgUhAhsGEgIlAQQbAxIEh3YIkV6MLo5VhEiMdYEjjCRmMIJlMmEDi2aBal+ETYRehUmNB4Fo X-IronPort-AV: E=Sophos;i="4.84,727,1355094000"; d="scan'208";a="3271518" Received: from mta01.urv.cat ([193.144.16.78]) by mail3-smtp-sop.national.inria.fr with ESMTP; 24 Feb 2013 12:57:57 +0100 X-IronPort-AV: E=Sophos;i="4.84,728,1355094000"; d="scan'208";a="35133827" Received: from pmbox2.urv.cat ([193.144.16.41]) by mta.urv.cat with ESMTP; 24 Feb 2013 12:57:57 +0100 Received: from Carlos1 (37.Red-83-37-44.dynamicIP.rima-tde.net [83.37.44.37]) (using TLSv1 with cipher AES128-SHA (128/128 bits)) (No client certificate requested) by pmbox2.urv.cat (Postfix) with ESMTPSA id E724EE368; Sun, 24 Feb 2013 12:57:44 +0100 (CET) From: "GRLMC" To: Date: Sun, 24 Feb 2013 12:57:43 +0100 Message-ID: <2E9466072F2846589180B069CF0B93B6@Carlos1> MIME-Version: 1.0 Content-Type: text/plain; charset="utf-8" Content-Transfer-Encoding: quoted-printable X-Mailer: Microsoft Office Outlook 11 Thread-index: Ac4Shideppb5Qhv+T5uQjVj0zklbOw== X-MimeOLE: Produced By Microsoft MimeOLE V6.0.6000.16669 X-Validation-by: grlmc@urv.cat Subject: [Caml-list] LATA 2013: call for participation *To be removed from our mailing list, please respond to this message with U= NSUBSCRIBE in the subject* ---------------------------------------------------------------------------= -------------------------------- 7th INTERNATIONAL CONFERENCE ON LANGUAGE AND AUTOMATA THEORY AND APPLICATIO= NS LATA 2013 Bilbao, Spain April 2-5, 2013 http://grammars.grlmc.com/LATA2013/ ---------------------------------------------------------------------------= ------------------------------- PROGRAMME Tuesday, April 2: 8:00 - 8:50 Registration 8:50 - 9:00 Opening 9:00 - 9:50 Jin-Yi Cai: Complexity Dichotomy for Counting Problems - Invite= d Lecture 9:50 - 10:00 Break 10:00 - 11:40 Brink Van der Merwe, Mark Farag, Jaco Geldenhuys: Counting Minimal Symmetri= c Difference NFAs Henning Fernau, Pinar Heggernes, Yngve Villanger: A Multivariate Analysis o= f Some DFA Problems Rodrigo de Souza: Uniformisation of Two-Way Transducers Kenji Hashimoto, Ryuta Sawada, Yasunori Ishihara, Hiroyuki Seki, Toru Fujiw= ara: Determinacy and Subsumption for Single-Valued Bottom-Up Tree Transduce= rs 11:40 - 12:10 Coffee Break 12:10 - 13:50 Aistis Atminas, Vadim Lozin, Mikhail Moshkov: Deciding WQO for Factorial La= nguages Eli Shamir: Pumping, Shrinking and Pronouns: from Context Free to Indexed G= rammars Krishnendu Chatterjee, Siddhesh Chaubal, Sasha Rubin: How to Travel Between= Languages Cewei Cui, Zhe Dang, Thomas R. Fischer, Oscar H. Ibarra: Execution Informat= ion Rate for Some Classes of Automata 13:50 - 15:30 Lunch 15:30 - 17:10 Jean-Marc Champarnaud, Jean-Philippe Dubernard, Hadrien Jeanne, Ludovic Mig= not: Two-Sided Derivatives for Regular Expressions and for Hairpin Expressi= ons Stuart Haber, William Horne, Pratyusa Manadhata, Miranda Mowbray, Prasad Ra= o: Efficient Submatch Extraction for Practical Regular Expression Daniel Go=C4=8D, Hamoon Mousavi, Jeffrey Shallit: On the Number of Unborder= ed Factors J=C3=B6rg Endrullis, Clemens Grabmayer, Dimitri Hendriks: Mix-Automatic Seq= uences 17:10 - 17:20 Break 17:20 - 18:10 Jo=C3=ABl Ouaknine: Discrete Linear Dynamical Systems (I) - I= nvited Tutorial Wednesday, April 3: 9:00 - 9:50 Jo=C3=ABl Ouaknine: Discrete Linear Dynamical Systems (II) - In= vited Tutorial 9:50 - 10:00 Break 10:00 - 11:40 Giorgio Delzanno, Riccardo Traverso: Decidability and Complexity Results fo= r Verification of Asynchronous Broadcast Networks Tim Smith: Infiniteness and Boundedness in 0L, DT0L, and T0L Systems Fabrizio Biondi, Axel Legay, Bo Friis Nielsen, Andrzej W=C4=85sowski: Maxim= izing Entropy over Markov Processes Olga Tveretina: A Conditional Superpolynomial Lower Bound for Extended Reso= lution 11:40 - 12:10 Coffee Break 12:10 - 13:50 Sebastian Bala, Artur Koni=C5=84ski: Unambiguous Automata Denoting Finitely= Sequential Functions Benedikt Bollig, Aiswarya Cyriac, Lo=C3=AFc H=C3=A9lou=C3=ABt, Ahmet Kara, = Thomas Schwentick: Dynamic Communicating Automata and Branching High-Level = MSCs Parisa Babaali, Christopher Knaplund: On the Construction of a Family of Au= tomata that are Generically Non-Minimal Sebastian Bala, Dariusz Jackowski: Limited Non-Determinism Hierarchy of Cou= nter Automata 13:50 - 15:30 Lunch 15:30 - 16:20 R=C5=ABsi=C5=86=C5=A1 Freivalds, Thomas Zeugmann, Grant Pogosyan: On the Si= ze Complexity of Deterministic Frequency Automata Johanna Bj=C3=B6rklund, Henning Fernau, Anna Kasprzik: MAT Learning of Univ= ersal Automata 16:20 - 16:30 Break 16:30 - 17:20 Luke Ong: Recursion Schemes, Collapsible Pushdown Automata, a= nd Higher-Order Model Checking (I) - Invited Tutorial 17:30 Visit to the City Thursday, April 4: 9:00 - 9:50 Luke Ong: Recursion Schemes, Collapsible Pushdown Automata, and= Higher-Order Model Checking (II) - Invited Tutorial 9:50 - 10:00 Break 10:00 - 11:40 Victor Selivanov, Anton Konovalov: Boolean Algebras of Regular =CF=89-Langu= ages Angelo Montanari, Pietro Sala: Interval Logics and =CF=89B-Regular Languages Karin Quaas: Model Checking Metric Temporal Logic over Automata with one Co= unter Takahito Aoto, Munehiro Iwami: Termination of Rule-Based Calculi for Unifor= m Semi-Unification 11:40 - 12:10 Coffee Break 12:10 - 13:50 Jurriaan Rot, Marcello Bonsangue, Jan Rutten: Coinductive Proof Techniques = for Language Equivalence Xiaojie Deng, Yu Zhang, Yuxin Deng, Farong Zhong: The Buffered =CF=80-calcu= lus: A Model for Concurrent Languages Michael Luttenberger, Maximilian Schlund: Convergence of Newton's Method ov= er Commutative Semirings Milka Hutagalung, Martin Lange, Etienne Lozes: Revealing vs. Concealing: Mo= re Simulation Games for B=C3=BCchi Inclusion 13:50 - 15:30 Lunch 15:30 - 17:10 Oscar Ibarra, Bala Ravikumar: On Bounded Languages and Reversal-Bounded Aut= omata Katsuhiko Nakamura, Keita Imada: Eliminating Stack Symbols in Push-Down Aut= omata and Linear Indexed Grammars V=C3=A9ronique Bruy=C3=A8re, Marc Ducobu, Olivier Gauwin: Visibly Pushdown = Automata: Universality and Inclusion via Antichains Florent Jacquemard, Michael Rusinowitch: Rewrite Closure and CF Hedge Autom= ata 17:10 - 17:20 Break 17:20 - 18:10 Thomas Schwentick: XML Schema Management: a Challenge for Aut= omata Theory - Invited Lecture Friday, April 5: 9:00 - 9:50 Kousha Etessami: Algorithms for Analyzing and Verifying Infinit= e-state Recursive Probabilistic Systems - Invited Lecture 9:50 - 10:00 Break 10:00 - 11:40 Friedrich Otto: Asynchronous PC Systems of Pushdown Automata Stanislav =C5=BD=C3=A1k, Ji=C5=99=C3=AD =C5=A0=C3=ADma: A Turing Machine Di= stance Hierarchy =C3=89ric Laugerotte, Nadia Ouali Sebti, Djelloul Ziadi: From Regular Tree = Expression to Position Tree Automaton Rajeev Alur, Sampath Kannan, Kevin Tian, Yifei Yuan: On The Complexity of S= hortest Path Problems on Discounted Cost Graphs 11:40 - 12:10 Coffee Break 12:10 - 13:50 Francine Blanchet-Sadri, Justin Lazarow: Suffix Trees for Partial Words and= the Longest Common Compatible Prefix Problem Daniel Go=C4=8D, Kalle Saari, Jeffrey Shallit: Primitive Words and Lyndon W= ords in Automatic and Linearly Recurrent Sequences Francine Blanchet-Sadri, Michelle Bodnar, Nathan Fox, Joe Hidakatsu: A Grap= h Polynomial Approach to Primitivity Luke Schaeffer: Ostrowski Numeration and the Local Period of Sturmian Words 13:50 - 15:30 Lunch 15:30 - 16:45 Seppo Sippu, Eljas Soisalon-Soininen: Online Matching of Multiple Regular P= atterns with Gaps and Character Classes Billel Benzaid, Riccardo Dondi, Nadia El-Mabrouk: Duplication-Loss Genome A= lignment: Complexity and Algorithm Tomasz Kociumaka, Jakub Radoszewski, Wojciech Rytter, Tomasz Wale=C5=84: Li= near-Time Version of Holub's Algorithm for Morphic Imprimitivity Testing 16:45 - 16:55 Break 16:55 - 17:45 Andrei Voronkov: The Lazy Reviewer Assignment Problem in Easy= Chair - Invited Lecture 17:45 Closing