Adrian-Horia Dediu Carlos Martín-Vide Bianca Truthe (Eds.) Language and 0 1 Automata Theory 8 7 S C and Applications N L 7th International Conference, LATA 2013 Bilbao, Spain, April 2013 Proceedings 123 Lecture Notes in Computer Science 7810 CommencedPublicationin1973 FoundingandFormerSeriesEditors: GerhardGoos,JurisHartmanis,andJanvanLeeuwen EditorialBoard DavidHutchison LancasterUniversity,UK TakeoKanade CarnegieMellonUniversity,Pittsburgh,PA,USA JosefKittler UniversityofSurrey,Guildford,UK JonM.Kleinberg CornellUniversity,Ithaca,NY,USA AlfredKobsa UniversityofCalifornia,Irvine,CA,USA FriedemannMattern ETHZurich,Switzerland JohnC.Mitchell StanfordUniversity,CA,USA MoniNaor WeizmannInstituteofScience,Rehovot,Israel OscarNierstrasz UniversityofBern,Switzerland C.PanduRangan IndianInstituteofTechnology,Madras,India BernhardSteffen TUDortmundUniversity,Germany MadhuSudan MicrosoftResearch,Cambridge,MA,USA DemetriTerzopoulos UniversityofCalifornia,LosAngeles,CA,USA DougTygar UniversityofCalifornia,Berkeley,CA,USA GerhardWeikum MaxPlanckInstituteforInformatics,Saarbruecken,Germany Adrian-Horia Dediu Carlos Martín-Vide Bianca Truthe (Eds.) Language and Automata Theory and Applications 7th International Conference, LATA 2013 Bilbao, Spain, April 2-5, 2013 Proceedings 1 3 VolumeEditors Adrian-HoriaDediu UniversitatRoviraiVirgili,ResearchGrouponMathematicalLinguistics AvingudaCatalunya,35,43002Tarragona,Spain E-mail:[email protected] CarlosMartín-Vide UniversitatRoviraiVirgili,ResearchGrouponMathematicalLinguistics AvingudaCatalunya,35,43002Tarragona,Spain E-mail:[email protected] BiancaTruthe Otto-von-Guericke-UniversitätMagdeburg,FakultätfürInformatik InstitutfürWissens-undSprachverarbeitung Universitätsplatz2,39106Magdeburg,Germany E-mail:[email protected] ISSN0302-9743 e-ISSN1611-3349 ISBN978-3-642-37063-2 e-ISBN978-3-642-37064-9 DOI10.1007/978-3-642-37064-9 SpringerHeidelbergDordrechtLondonNewYork LibraryofCongressControlNumber:2013932557 CRSubjectClassification(1998):F.1,F.4,F.2-3,I.2,I.4 LNCSSublibrary:SL1–TheoreticalComputerScienceandGeneralIssues ©Springer-VerlagBerlinHeidelberg2013 Thisworkissubjecttocopyright.Allrightsarereserved,whetherthewholeorpartofthematerialis concerned,specificallytherightsoftranslation,reprinting,re-useofillustrations,recitation,broadcasting, reproductiononmicrofilmsorinanyotherway,andstorageindatabanks.Duplicationofthispublication orpartsthereofispermittedonlyundertheprovisionsoftheGermanCopyrightLawofSeptember9,1965, inistcurrentversion,andpermissionforusemustalwaysbeobtainedfromSpringer.Violationsareliable toprosecutionundertheGermanCopyrightLaw. Theuseofgeneraldescriptivenames,registerednames,trademarks,etc.inthispublicationdoesnotimply, evenintheabsenceofaspecificstatement,thatsuchnamesareexemptfromtherelevantprotectivelaws andregulationsandthereforefreeforgeneraluse. Typesetting:Camera-readybyauthor,dataconversionbyScientificPublishingServices,Chennai,India Printedonacid-freepaper SpringerispartofSpringerScience+BusinessMedia(www.springer.com) Preface These proceedings contain the papers that were presented at the 7th Interna- tional Conference on Languageand Automata Theory and Applications (LATA 2013), held in Bilbao, Spain, during April 2-5, 2013. The scope of LATA is rather broad, including: algebraic language theory; algorithmsforsemi-structureddatamining;algorithmsonautomataandwords; automataand logic;automata for systemanalysisand programverification;au- tomata, concurrency and Petri nets; automatic structures; cellular automata; combinatorics on words; computability; computational complexity; computa- tional linguistics; data and image compression; decidability questions on words and languages;descriptional complexity;DNA and other models of bio-inspired computing; document engineering; foundations of finite state technology; foun- dations of XML; fuzzy and rough languages; grammars (Chomsky hierarchy, contextual, multidimensional, unification, categorial, etc.); grammars and au- tomata architectures; grammatical inference and algorithmic learning; graphs and graph transformation; language varieties and semigroups; language-based cryptography;language-theoreticfoundations of artificialintelligence and artifi- cial life; parallel and regulated rewriting; parsing; pattern recognition; patterns and codes; power series; quantum, chemical, and optical computing; semantics; string and combinatorial issues in computational biology and bioinformatics; stringprocessingalgorithms;symbolicdynamics;symbolicneuralnetworks;term rewriting; transducers; trees, tree languages and tree automata; weighted au- tomata. LATA2013received97submissions.EachonewasreviewedbythreeProgram Committee members, many of whom consulted with external referees. After a thorough and vivid discussion phase, the committee decided to accept 45 pa- pers (which represents an acceptance rate of 46.39%). The conference program also included four invited talks and two invited tutorials. Part of the success in the management of such a large number of submissions is due to the excellent facilities provided by the EasyChair conference management system. We would like to thank all invited speakers and authors for their contri- butions, the Program Committee and the reviewers for their cooperation, and Springer for its very professionalpublishing work. January 2013 Adrian-Horia Dediu Carlos Mart´ın-Vide Bianca Truthe Organization LATA 2013 was organizedby the Basque Center for Applied Mathematics, Bil- bao,andtheResearchGrouponMathematicalLinguistics—GRLMC fromthe University Rovira i Virgili, Tarragona. Program Committee ParoshAziz Abdulla Uppsala University, Sweden Franz Baader Dresden University of Technology,Germany Jos Baeten CWI Amsterdam, The Netherlands Christel Baier Dresden University of Technology,Germany Gerth Stølting Brodal Aarhus University, Denmark John Case University of Delaware,Newark, USA Marek Chrobak University of California, Riverside, USA Mariangiola Dezani University of Turin, Italy Rod Downey VictoriaUniversityofWellington,NewZealand Ding-Zhu Du University of Texas, Dallas, USA E. Allen Emerson University of Texas, Austin, USA Javier Esparza Technical University of Munich, Germany Michael R. Fellows Charles Darwin University, Darwin, Australia Alain Finkel ENS Cachan, France Dov M. Gabbay King’s College, London, UK Ju¨rgen Giesl Aachen University, Germany Rob van Glabbeek NICTA, Sydney, Australia Georg Gottlob University of Oxford, UK Annegret Habel University of Oldenburg, Germany Reiko Heckel University of Leicester, UK Sanjay Jain National University of Singapore Charanjit S. Jutla IBM Thomas J. Watson Research Center, Hawthorne, USA Ming-Yang Kao Northwestern University, Evanston, USA Deepak Kapur University of New Mexico, Albuquerque, USA Joost-Pieter Katoen Aachen University, Germany S. Rao Kosaraju Johns Hopkins University, Baltimore, USA Evangelos Kranakis Carleton University, Ottawa, Canada Hans-J¨org Kreowski University of Bremen, Germany Tak-Wah Lam University of Hong Kong, China Gad M. Landau University of Haifa, Israel Kim G. Larsen Aalborg University, Denmark VIII Organization Richard Lipton Georgia Institute of Technology, Atlanta, USA Jack Lutz Iowa State University, Ames, USA Ian Mackie E´cole Polytechnique, Palaiseau,France Rupak Majumdar MaxPlanckInstitute,Kaiserslautern,Germany Carlos Mart´ın-Vide (Chair) Rovira i Virgili University, Tarragona,Spain Paliath Narendran University at Albany, SUNY, USA Tobias Nipkow Technical University of Munich, Germany David A. Plaisted UniversityofNorthCarolina,ChapelHill,USA Jean-Franc¸ois Raskin Free University of Brussels, Belgium Wolfgang Reisig Humboldt University, Berlin, Germany Micha¨el Rusinowitch LORIA, Nancy, France Davide Sangiorgi University of Bologna,Italy Bernhard Steffen Technical University of Dortmund, Germany Colin Stirling University of Edinburgh, UK Alfonso Valencia CNIO, Madrid, Spain Helmut Veith Vienna University of Technology, Austria Heribert Vollmer Leibniz University of Hannover, Germany Osamu Watanabe Tokyo Institute of Technology, Japan Pierre Wolper University of Li`ege, Belgium Louxin Zhang National University of Singapore External Reviewers Amit, Mika Ganty, Pierre Anantharaman, Siva Gasarch, William Atkinson, Mike Gentilini, Raffaela Boigelot, Bernard Gero, Kimberly Bollig, Benedikt Gierds, Christian Bonnet, R´emi Haase, Christoph Bouchard, Chris Harju, Tero Braibant, Thomas Hertrampf, Ulrich Carle, Benjamin Holik, Lukas Charatonik, Witold Holub, Stepan Charlier, Emilie Howar, Falk Chistikov, Dmitry Isberner, Malte Dang, Zhe Janicki, Ryszard Davoodi, Pooya Jezequel, Loig Delzanno, Giorgio Kejlberg-Rasmussen,Casper Dubslaff, Clemens Khoussainov,Bhakhadyr Fates, Nazim Klaedtke, Felix Fernau, Henning Konnov, Igor Filiot, Emmanuel Kopelowitz, Tsvi Flick, Nils Erik Kuester, Jochen Formenti, Enrico Kuske, Dietrich Organization IX Lee, Lap-Kei Ringeissen, Christophe Leiß, Hans Riveros, Cristian Lushman, Brad Rosenkrantz, Daniel Luttenberger, Michael Rozenberg, Liat Makowsky,Johann Rubin, Sasha Malik, Avinash Ru¨thing, Oliver Manea, Florin Saivasan, Prakash Marx, Maarten Salvati, Sylvain McKenzie, Pierre Seidl, Helmut Merten, Maik Servais, Fr´ed´eric Mignosi, Filippo Servetto, Marco Murlak, Filip Shallit, Jeffrey Mu¨ller, Moritz Siebert, Heike Mu¨ller, Richard Sproston, Jeremy NarayanKumar, K. Stephan, Frank Nguyen, Viet Yen Su¨rmeli, Jan Niehren, Joachim Talpin, Jean-Pierre Nielsen, Jesper Asbjørn Sindahl Tittmann, Peter Noll, Thomas Traytel, Dmitriy Nowotka, Dirk Venturini, Rossano Okhotin, Alexander Vialette, St´ephane Oliart, Alberto Wagner, Christoph Perrin, Dominique Wedel Vildhøj, Hjalte Piskorski,Jakub Widder, Josef Pru¨fer, Robert Wimmer, Ralf Pulman, Stephen Zuleger, Florian Rabkin, Max Yagnatinsky, Mark Radke, Hendrik Organizing Committee Adrian-Horia Dediu Tarragona Peter Leupold Tarragona Carlos Mart´ın-Vide Tarragona(Co-chair) Magaly Rolda´n Bilbao Bianca Truthe Magdeburg Florentina-Lilica Voicu Tarragona Enrique Zuazua Bilbao (Co-chair) Table of Contents Invited Talks Complexity Dichotomy for Counting Problems....................... 1 Jin-Yi Cai Algorithms for Analyzing and Verifying Infinite-State Recursive Probabilistic Systems............................................. 12 Kousha Etessami RecursionSchemes,Collapsible PushdownAutomata and Higher-Order Model Checking ................................................. 13 Luke Ong Discrete Linear Dynamical Systems ................................ 42 Jo¨el Ouaknine XML Schema Management: A Challenge for Automata Theory ........ 43 Thomas Schwentick Regular Papers On the Complexity of Shortest Path Problems on Discounted Cost Graphs ......................................................... 44 Rajeev Alur, Sampath Kannan, Kevin Tian, and Yifei Yuan Termination of Rule-Based Calculi for Uniform Semi-Unification ....... 56 Takahito Aoto and Munehiro Iwami Deciding WQO for Factorial Languages............................. 68 Aistis Atminas, Vadim Lozin, and Mikhail Moshkov On the Construction of a Family of Automata That Are Generically Non-minimal .................................................... 80 Parisa Babaali and Christopher Knaplund Limited Non-determinism Hierarchy of Counter Automata ............ 92 Sebastian Bala and Dariusz Jackowski Unambiguous Automata Denoting Finitely Sequential Functions ....... 104 Sebastian Bala and Artur Konin´ski Duplication-Loss Genome Alignment: Complexity and Algorithm....... 116 Billel Benzaid, Riccardo Dondi, and Nadia El-Mabrouk XII Table of Contents Maximizing Entropy over Markov Processes ......................... 128 Fabrizio Biondi, Axel Legay, Bo Friis Nielsen, and Andrzej Wasowski (cid:2) MAT Learning of Universal Automata .............................. 141 Johanna Bj¨orklund, Henning Fernau, and Anna Kasprzik A Graph PolynomialApproach to Primitivity ....................... 153 Francine Blanchet-Sadri, Michelle Bodnar, Nathan Fox, and Joe Hidakatsu Suffix Trees for Partial Words and the Longest Common Compatible Prefix Problem .................................................. 165 Francine Blanchet-Sadri and Justin Lazarow Dynamic Communicating Automata and Branching High-Level MSCs .......................................................... 177 Benedikt Bollig, Aiswarya Cyriac, Lo¨ıc H´elou¨et, Ahmet Kara, and Thomas Schwentick Visibly Pushdown Automata: Universality and Inclusion via Antichains ...................................................... 190 V´eronique Bruy`ere, Marc Ducobu, and Olivier Gauwin Two-Sided Derivatives for Regular Expressions and for Hairpin Expressions ..................................................... 202 Jean-Marc Champarnaud, Jean-Philippe Dubernard, Hadrien Jeanne, and Ludovic Mignot How to Travel between Languages.................................. 214 Krishnendu Chatterjee, Siddhesh Chaubal, and Sasha Rubin Execution Information Rate for Some Classes of Automata............ 226 Cewei Cui, Zhe Dang, Thomas R. Fischer, and Oscar H. Ibarra Decidability and Complexity Results for Verification of Asynchronous BroadcastNetworks .............................................. 238 Giorgio Delzanno and Riccardo Traverso The Buffered π-Calculus: A Model for ConcurrentLanguages.......... 250 Xiaojie Deng, Yu Zhang, Yuxin Deng, and Farong Zhong Mix-Automatic Sequences......................................... 262 J¨org Endrullis, Clemens Grabmayer, and Dimitri Hendriks A Multivariate Analysis of Some DFA Problems ..................... 275 Henning Fernau, Pinar Heggernes, and Yngve Villanger On the Size Complexity of Deterministic Frequency Automata......... 287 Ru¯sin¸ˇs Freivalds, Thomas Zeugmann, and Grant R. Pogosyan
Description: