Developments in Language Theory: 23rd International Conference, DLT 2019, Warsaw, Poland, August 5–9, 2019, Proceedings

328 Pages·2019·9.461 MB·

by  Piotrek Hofman, Michał Skrzypczak

Piotrek Hofman
Michał Skrzypczak (Eds.)
7
4 Developments
6
1
1

S
in Language Theory
C
N
L
23rd International Conference, DLT 2019
Warsaw, Poland, August 5–9, 2019
Proceedings
Lecture Notes in Computer Science 11647
Commenced Publication in 1973
Founding and Former Series Editors:
Gerhard Goos, Juris Hartmanis, and Jan van Leeuwen
Editorial Board Members
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, Zurich, 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, Chennai, 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
More information about this series at http://www.springer.com/series/7407
ł
Piotrek Hofman Micha Skrzypczak (Eds.)
(cid:129)
Developments
in Language Theory
23rd International Conference, DLT 2019
–
Warsaw, Poland, August 5 9, 2019
Proceedings
123
Editors
Piotrek Hofman Michał Skrzypczak
University of Warsaw University of Warsaw
Warsaw,Poland Warsaw,Poland
ISSN 0302-9743 ISSN 1611-3349 (electronic)
Lecture Notesin Computer Science
ISBN 978-3-030-24885-7 ISBN978-3-030-24886-4 (eBook)
https://doi.org/10.1007/978-3-030-24886-4
LNCSSublibrary:SL1–TheoreticalComputerScienceandGeneralIssues
©SpringerNatureSwitzerlandAG2019
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, expressed or implied, with respect to the material contained herein or for any errors or
omissionsthatmayhavebeenmade.Thepublisherremainsneutralwithregardtojurisdictionalclaimsin
publishedmapsandinstitutionalaffiliations.
ThisSpringerimprintispublishedbytheregisteredcompanySpringerNatureSwitzerlandAG
Theregisteredcompanyaddressis:Gewerbestrasse11,6330Cham,Switzerland
Preface
ThisvolumeofLectureNotesinComputerSciencecontainsthepaperspresentedatthe
23rd International Conference on Developments in Language Theory (DLT 2019)
organized by the faculty of Mathematics, Informatics and Mechanics at University of
Warsaw in Poland, during August 5–9, 2019.
The DLT conference series is one of the major international conference series in
language theory and related areas. Since it was started by G. Rozenberg and A.
Salomaa in Turku (1993), it travelled around the world visiting different locations:
Magdeburg(1995),Thessaloniki(1997),Aachen(1999),Vienna(2001),Kyoto(2002),
Szeged(2003),Auckland(2004),Palermo(2005),SantaBarbara(2006),Turku(2007),
Kyoto (2008), Stuttgart (2009), London (2010), Milan (2011), Taipei (2012),
Marne-la-Vallée (2013), Ekaterinburg (2014), Liverpool (2015), Montréal (2016),
Liège (2017), and Tokyo (2018). In 2019 for the first time it took place in Poland.
The series of International Conference on Developments in Language Theory
(DLT) provides a forum for presenting current developments in formal languages and
automata. Its scope is very general and includes, among others, the following topics
and areas: combinatorial and algebraic properties of words and languages; grammars,
acceptors, and transducers for strings, trees, graphs, arrays; algebraic theories for
automataandlanguages; codes;efficient textalgorithms; symbolicdynamics; decision
problems; relationships to complexity theory and logic; picture description and anal-
ysis; polyominoes and bidimensional patterns; cryptography; concurrency; cellular
automata; bio-inspired computing; and quantum computing.
There were 33 abstract submissions, among which three were withdrawn, from 20
countries: Belarus, Belgium, Canada, China, Czech Republic, Finland, France,
Germany, India, Italy, Japan, Portugal, Russia, Singapore, Slovakia, South Korea,
Taiwan, UAE, UK, and USA. Each of the 30 submissions was reviewed by at least
threereviewersandthoroughlydiscussedbyProgramCommittee(PC).Thecommittee
decided to accept 20 papers for publication and oral presentation. The volume also
includes papers of three invited talks given at the conference.
Wewarmlythankalltheinvitedspeakersandallauthorsofthesubmittedpapersfor
making DLT 2019 successful. As the PC chairs, we would like to express our cordial
gratitudetothemembersofthePCandtheexternalreviewersforreviewingthepapers,
participating in the selection process, and helping to maintain the high standard of the
DLT conferences. We appreciate the help of the EasyChair conference system for
facilitating our work of organizing DLT 2019 very much. We would like to thank the
editorial staff of Springer, in particular Saravanan Gnanaprakasam, Alfred Hofmann,
AnnaKramer,andErikaSiebert-Cole,fortheirguidanceandhelpduringtheprocessof
publishing this volume.
We also would like to thank Ewelina Sołtan, and all the members of the research
support unit at the Faculty of Mathematics, Informatics, and Mechanics at the
University of Warsaw for their support. Last but not the least, we are grateful to
vi Preface
Organizing Committee members: Grzegorz Fabiański, Kamila Łyczek, Vincent
Michielini, Radosław Piórkowski, and Janusz Schmude. DLT 2019 was financially
supportedbyUniversityofWarsaw,wewouldliketoexpressoursinceregratitudefor
their philanthropic support.
We are all looking forward to DLT 2020 at that will be held during May 11–15,
2020, at University of South Florida, Tampa FL, USA.
June 2019 Piotr Hofman
Michał Skrzypczak
Organization
Steering Committee
Marie-Pierre Béal University of Paris-Est Marne-la-Vallée, France
Mikołaj Bojańczyk University of Warsaw, Poland
Cristian S. Calude The University of Auckland, New Zealand
Volker Diekert University of Stuttgart, Germany
Yo-Sub Han Yonsei University, Seoul, Republic of Korea
Juraj Hromkovic Swiss Federal Institute of Technology in Zurich,
Switzerland
Oscar H. Ibarra University of California, Santa Barbara, USA
Nataša Jonoska University of South Florida, USA
Juhani Karhumäki University of Turku, Finland
Martin Kutrib University of Giessen, Germany
Giovanni Pighizzini University of Milan, Italy
Michel Rigo University of Liège, Belgium
Antonio Restivo University of Palermo, Italy
Wojciech Rytter University of Warsaw, Poland
Kai Salomaa Queen’s University at Kingston, Ontario, Canada
Shinnosuke Seki University of Electro-Communications, Tokyo, Japan
Mikhail Volkov Ural Federal University, Ekaterinburg, Russia
Takashi Yokomori Waseda University, Tokyo, Japan
Program Committee
Jacques Duparc University of Lausanne, Switzerland
Pierre Ganty IMDEA Research, Spain and Université de Bruxelles,
Belgium
Paweł Gawrychowski University of Wrocław, Poland
Tero Harju University of Turku, Finland
Kenji Hashimoto Nagoya University, Japan
Piotrek Hofman (Co-chair) University of Warsaw, Poland
Tomohiro I. Kyushu Institute of Technology, Japan
Denis Kuperberg École normale superieure de Lyon, France
Christof Löding RWTH Aachen University, Germany
Amaldev Manuel Indian Institute of Technology Goa, India
Thomas Place Université de Bordeaux, France
Svetlana Puzynina Sobolev Institute of Mathematics, Russia
Karin Quaas Leipzig University, Germany
Cristian Riveros Pontifical Catholic University of Chile, Chile
Krishna S. Indian Institute of Technology, Bombay, India
Philippe Schnoebelen Laboratoire Spécification et Vérification, France
Marinella Sciortino University of Palermo, Italy
viii Organization
Michał Skrzypczak (Chair) University of Warsaw, Poland
Mikhail Volkov Ural Federal University, Russia
James Worrell University of Oxford, UK
Georg Zetzsche Max Planck Institute for Software Systems, Germany
Organizing Committee
Grzegorz Fabiański Support
Piotrek Hofman Co-chair
Kamila Łyczek Graphic Designer
Vincent Michielini Support
Radosław Piórkowski Webmaster
Janusz Schmude Brochure Editor
Michał Skrzypczak Chair
Additional Reviewers
Bartłomiej Dudek Lucas Martinelli Tabajara
Ramanathan Thinniyam Marek Szykuła
Abhisekh Sankaran Simon Iosti
Sarah Winter Benedikt Bollig
Elise Vandomme A. V. Sreejith
Irène Marcovici Stefan Göller
Martin Sulzmann Aleksi Saarela
Olga Parshina Kenny Zhuo Ming Lu
Mahsa Shirmohammadi Flavio Dalessandro
Mikhail Berlinkov Anup Basil Mathew
Matthias Niewerth Natalie Schluter
Simone Rinaldi Dmitry Chistikov
Christian Choffrut Eryk Kopczynski
Ulrich Ultes-Nitsche Dmitry Ananichev
Zhimin Sun Yasunori Ishihara
Carton Olivier Cyril Nicaud
Benjamin Hellouin de Menibus Moses Ganardi
Arseny Shur Sylvain Lombardy
Alessandro De Luca Olivier Carton
Andrea Frosini Markus L. Schmid
Vladimir Gusev Giuseppa Castiglione
Pablo Rotondo Dominik Köppl
Laurent Doyen
Contents
Invited Papers
Inherent Size Blowup in x-Automata . . . . . . . . . . . . . . . . . . . . . . . . . . . . 3
Udi Boker
Deciding Context Unification (with Regular Constraints) . . . . . . . . . . . . . . . 18
Artur Jeż
Single-Stranded Architectures for Computing . . . . . . . . . . . . . . . . . . . . . . . 41
Shinnosuke Seki
Regular Papers
A Linear Bound on the K-Rendezvous Time for Primitive Sets
of NZ Matrices. . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 59
Umer Azfar, Costanza Catalano, Ludovic Charlier,
and Raphaël M. Jungers
Words of Minimum Rank in Deterministic Finite Automata. . . . . . . . . . . . . 74
Jarkko Kari, Andrew Ryzhikov, and Anton Varonka
On the Length of Shortest Strings Accepted by Two-Way
Finite Automata . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 88
Egor Dobronravov, Nikita Dobronravov, and Alexander Okhotin
Characterizing the Valuedness of Two-Way Finite Transducers. . . . . . . . . . . 100
Di-De Yen and Hsu-Chun Yen
Input-Driven Pushdown Automata for Edit Distance Neighborhood. . . . . . . . 113
Viliam Geffert, Zuzana Bednárová, and Alexander Szabari
The Relative Edit-Distance Between Two Input-Driven Languages . . . . . . . . 127
Hyunjoon Cheon, Yo-Sub Han, Sang-Ki Ko, and Kai Salomaa
On Shrinking Restarting Automata of Window Size One and Two . . . . . . . . 140
František Mráz and Friedrich Otto
The Teaching Complexity of Erasing Pattern Languages with Bounded
Variable Frequency. . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 154
Ziyuan Gao
On Timed Scope-Bounded Context-Sensitive Languages . . . . . . . . . . . . . . . 168
D. Bhave, S. N. Krishna, R. Phawade, and A. Trivedi