ebook img

Combinatorics on Words: 10th International Conference, WORDS 2015, Kiel, Germany, September 14-17, 2015, Proceedings PDF

254 Pages·2015·6.875 MB·English
Save to my drive
Quick download
Download
Most books are stored in the elastic cloud where traffic is expensive. For this reason, we have a limit on daily download.

Preview Combinatorics on Words: 10th International Conference, WORDS 2015, Kiel, Germany, September 14-17, 2015, Proceedings

Florin Manea Dirk Nowotka (Eds.) 4 Combinatorics 0 3 9 S on Words C N L 10th International Conference, WORDS 2015 Kiel, Germany, September 14–17, 2015 Proceedings 123 Lecture Notes in Computer Science 9304 Commenced Publication in 1973 Founding and Former Series Editors: Gerhard Goos, Juris Hartmanis, and Jan van Leeuwen Editorial Board David Hutchison Lancaster University, Lancaster, UK Takeo Kanade Carnegie Mellon University, Pittsburgh, PA, USA Josef Kittler University of Surrey, Guildford, UK Jon M. Kleinberg Cornell University, Ithaca, NY, USA Friedemann Mattern ETH Zurich, Zürich, Switzerland John C. Mitchell Stanford University, Stanford, CA, USA Moni Naor Weizmann Institute of Science, Rehovot, Israel C. Pandu Rangan Indian Institute of Technology, Madras, India Bernhard Steffen TU Dortmund University, Dortmund, Germany Demetri Terzopoulos University of California, Los Angeles, CA, USA Doug Tygar University of California, Berkeley, CA, USA Gerhard Weikum Max Planck Institute for Informatics, Saarbrücken, Germany More information about this series at http://www.springer.com/series/7407 Florin Manea Dirk Nowotka (Eds.) (cid:129) Combinatorics on Words 10th International Conference, WORDS 2015 – Kiel, Germany, September 14 17, 2015 Proceedings 123 Editors Florin Manea DirkNowotka UniversitätKiel UniversitätKiel Kiel Kiel Germany Germany ISSN 0302-9743 ISSN 1611-3349 (electronic) Lecture Notesin Computer Science ISBN 978-3-319-23659-9 ISBN978-3-319-23660-5 (eBook) DOI 10.1007/978-3-319-23660-5 LibraryofCongressControlNumber:2015947798 LNCSSublibrary:SL1–TheoreticalComputerScienceandGeneralIssues SpringerChamHeidelbergNewYorkDordrechtLondon ©SpringerInternationalPublishingSwitzerland2015 Thisworkissubjecttocopyright.AllrightsarereservedbythePublisher,whetherthewholeorpartofthe material is concerned, specifically the rights of translation, reprinting, reuse of illustrations, recitation, broadcasting, reproduction on microfilms or in any other physical way, and transmission or information storageandretrieval,electronicadaptation,computersoftware,orbysimilarordissimilarmethodologynow knownorhereafterdeveloped. Theuseofgeneraldescriptivenames,registerednames,trademarks,servicemarks,etc.inthispublication doesnotimply,evenintheabsenceofaspecificstatement,thatsuchnamesareexemptfromtherelevant protectivelawsandregulationsandthereforefreeforgeneraluse. Thepublisher,theauthorsandtheeditorsaresafetoassumethattheadviceandinformationinthisbookare believedtobetrueandaccurateatthedateofpublication.Neitherthepublishernortheauthorsortheeditors give a warranty, express or implied, with respect to the material contained herein or for any errors or omissionsthatmayhavebeenmade. Printedonacid-freepaper SpringerInternationalPublishingAGSwitzerlandispartofSpringerScience+BusinessMedia (www.springer.com) Preface This volume contains the proceedings of the 10th International Conference on WORDS, which took place at Kiel University, Germany, September 14-17, 2015. WORDS is the main conference series devoted to the mathematical theory of words, and it takes place every two years. The first conference in the series was organized in 1997inRouen,France, withtheeventsthat followedtakingplace inRouen,Palermo, Turku, Montreal, Marseille, Salerno, Prague, and Turku. The main object in the scope of the conference, words, are finite or infinite sequences of symbols over a finite alphabet. They appear as natural and basic math- ematical model in many areas, theoretical or applicative. Accordingly, the WORDS conferenceisopentoboththeoreticalcontributionsrelatedtocombinatorial,algebraic, and algorithmic aspects of words, as well as to contributions presenting applications of the theory of words, for instance, in other fields of computer science, linguistics, biology and bioinformatics, or physics. For the second time in the history of WORDS, after the 2013 edition, a refereed proceedings volume was published in Springer’s Lecture Notes in Computer Science series. In addition, a local proceedings volume was published in the Kiel Computer Science Series of the Kiel University. Being a conference at the border between the- oretical computer science and mathematics, WORDS tries to capture in its two pro- ceedingsvolumesthecharacteristicsoftheconferencesfromboththeseworlds.While the Lecture Notes in Computer Science volume is dedicated to original contributions that fulfil the high quality standards required by a formal publication in computer science,thelocalproceedingsvolumeallows,inthespiritofmathematicsconferences, the publication of less formally prepared contributions, informing on current research and work in progress, surveying some areas connected to the core topics of WORDS, or presenting relevant previously published results. All the papers, the ones published in the Lecture Notes in Computer Science proceedings volume or the ones from the local proceedings volume, were refereed to high standards by the members of the Program Committee. Following the conference, a special issue of the Theoretical Computer Science journal will be edited. We received 22 submissions, from 15 countries. From these, 14 papers were selected to be published in this refereed proceedings volume. In addition to the con- tributed talks, the conference program included six invited talks given by leading experts in the areas covered by the WORDS conference: Jörg Endrullis (Amsterdam), MarkusLohrey(Siegen),JeanNéraud(Rouen),DominiquePerrin(Paris),MichaëlRao (Lyon), Thomas Stoll (Nancy). Extended abstracts of these talks are included in this proceedingsvolume.WORDS2015wasthetenthconferenceintheseries,sowewere extremelyhappytowelcome,asinvitedspeakeratthisanniversaryevent,JeanNéraud, oneoftheinitiatorsoftheseriesandthemainorganizerofthefirsttwoiterationsofthis conference. We thank all the invited speakers and all the authors of submitted papers for their contributions to the success of the conference. VI Preface WearegratefultothemembersoftheProgramCommitteefortheirworkthatledto the selection of the contributed talks, and, implicitly, of the papers published in this volume. They were assisted in their task by a series of external referees, gratefully acknowledged below. The submission and reviewing process was performed via the Easychair system; we thank Andrej Voronkov for this system which facilitated the workoftheProgramCommitteeandtheeditorsconsiderably.Weexpressourgratitude to the representatives of Springer for their collaboration. Finally, we thank the Orga- nizing Committee of WORDS 2015 for ensuring the smooth run of the conference. September 2015 Dirk Nowotka Florin Manea Organization Program Committee Maxime Crochemore King’s College London, UK James Currie University of Winnipeg, Canada Stepan Holub Charles University in Prague, Czech Republic Juhani Karhumäki University of Turku, Finland Manfred Kufleitner University of Stuttgart, Germany Gad Landau University of Haifa, Israel Dirk Nowotka Kiel University, Germany (PC-Chair) Wojciech Plandowski University of Warsaw, Poland Antonio Restivo University of Palermo, Italy Michel Rigo University of Liège, Belgium Mikhail Volkov Ural State University, Russia Luca Zamboni University Lyon 1, France Additional Reviewers Allouche, Jean-Paul Glen, Amy Saarela, Aleksi Amit, Mika Hadravova, Jana Sebastien, Labbe Badkobeh, Golnaz Leroy, Julien Sheinwald, Dafna Bucci, Michelangelo Manea, Florin Smyth, William F. Charlier, Emilie Mantaci, Sabrina Stipulanti, Manon De Luca, Alessandro Mercas, Robert Szabados, Michal Dekking, Michel Plandowski, Wojciech Sýkora, Jiří Epifanio, Chiara Prodinger, Helmut Widmer, Steven Ferenczi, Sebastien Puzynina, Svetlana Zaroda, Artur Fici, Gabriele Rozenberg, Liat Abstracts of Invited Talks Degrees of Transducibility Jörg Endrullis1, Jan Willem Klop1,2, Aleksi Saarela3, and Markus Whiteland3 1Departmentof Computer Science, VUUniversity Amsterdam, Amsterdam, TheNetherlands 2Centrum voorWiskundeenInformatica (CWI), Amsterdam, The Netherlands 3Department of MathematicsandStatistics &FUNDIM, University of Turku,Turku,Finland Abstract. Our objects of study are infinite sequences and how they can be transformed into each other. As transformational devices, we focus here on Turing Machines, sequential finite state transducers and Mealy Machines. For eachofthesechoices,theresultingtransducibilityrelation (cid:1) isapreorderonthe set of infinite sequences. This preorder induces equivalence classes, called degrees,andapartialorder onthe degrees. ForTuringMachines,thisstructureofdegreesiswell-studiedandknownas degreesofunsolvability.However,inthishierarchy,allthecomputablestreams are identified in the bottom degree. It is therefore interesting to study transduc- ibility with respect to weaker computational models, giving rise to more fine-grained structures of degrees. In contrast with the degrees of unsolvability, very little is known about the structure of degrees obtained from finite state transducers or Mealy Machines.

See more

The list of books you might like

Most books are stored in the elastic cloud where traffic is expensive. For this reason, we have a limit on daily download.