Lecture Notes in Computer Science 8031

Transcription

1 Lecture Notes in Computer Science 8031 Commenced Publication in 1973 Founding and Former Series Editors: Gerhard Goos, Juris Hartmanis, and Jan van Leeuwen Editorial Board David Hutchison Lancaster University, UK Takeo Kanade Carnegie Mellon University, Pittsburgh, PA, USA Josef Kittler University of Surrey, Guildford, UK Jon M. Kleinberg Cornell University, Ithaca, NY, USA Alfred Kobsa University of California, Irvine, CA, USA Friedemann Mattern ETH Zurich, Switzerland John C. Mitchell Stanford University, CA, USA Moni Naor Weizmann Institute of Science, Rehovot, Israel Oscar Nierstrasz University of Bern, Switzerland C. Pandu Rangan Indian Institute of Technology, Madras, India Bernhard Steffen TU Dortmund University, Germany Madhu Sudan Microsoft Research, Cambridge, MA, USA Demetri Terzopoulos University of California, Los Angeles, CA, USA Doug Tygar University of California, Berkeley, CA, USA Gerhard Weikum Max Planck Institute for Informatics, Saarbruecken, Germany

2 Helmut Jürgensen Rogério Reis (Eds.) Descriptional Complexity of Formal Systems 15th International Workshop, DCFS 2013 London, ON, Canada, July 22-25, 2013 Proceedings 13

3 Volume Editors Helmut Jürgensen Western University, Department of Computer Science Middlesex College, London, ON N6A 5B7, Canada Rogério Reis Universidade do Porto, Faculdade de Ciências Departamento de Ciência de Computadores Rua do Campo Alegre , Porto, Portugal ISSN e-issn ISBN e-isbn DOI / Springer Heidelberg Dordrecht London New York Library of Congress Control Number: CR Subject Classification (1998): F.1.1-3, F.4.2-3, F.2-3 LNCS Sublibrary: SL 1 Theoretical Computer Science and General Issues Springer-Verlag Berlin Heidelberg 2013 This work is subject to copyright. All rights are reserved by the Publisher, whether the whole or part of the 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 storage and retrieval, electronic adaptation, computer software, or by similar or dissimilar methodology now known or hereafter developed. Exempted from this legal reservation are brief excerpts in connection with reviews or scholarly analysis or material supplied specifically for the purpose of being entered and executed on a computer system, for exclusive use by the purchaser of the work. Duplication of this publication or parts thereof is permitted only under the provisions of the Copyright Law of the Publisher s location, in ist current version, and permission for use must always be obtained from Springer. Permissions for use may be obtained through RightsLink at the Copyright Clearance Center. Violations are liable to prosecution under the respective Copyright Law. The use of general descriptive names, registered names, trademarks, service marks, etc. in this publication does not imply, even in the absence of a specific statement, that such names are exempt from the relevant protective laws and regulations and therefore free for general use. While the advice and information in this book are believed to be true and accurate at the date of publication, neither the authors nor the editors nor the publisher can accept any legal responsibility for any errors or omissions that may be made. The publisher makes no warranty, express or implied, with respect to the material contained herein. Typesetting: Camera-ready by author, data conversion by Scientific Publishing Services, Chennai, India Printed on acid-free paper Springer is part of Springer Science+Business Media (

4 Preface The 15th International Workshop on Descriptional Complexity of Formal Systems, DCFS 2013, was held in London (Ontario, Canada) in July of 2013 at Western University. The annual DCFS workshop series has two origins: The workshop FDSR Formal Descriptions and Software Reliability first held in 1998 in Paderborn (Germany) and the workshop DCAGRS Descriptional Complexity of Automata, Grammars an Related Structures first held in 1999 in Magdeburg (Germany). FDSR met again in Boca Raton (Florida, USA) and in San Jose (California, USA) in 1999 and 2000, while DCAGRS was held in London (Ontario, Canada) and in Vienna (Austria) in 2000 and The two series merged into DCFS with the next meeting in 2002 held again in London (Canada). Since then DCFS has visited Budapest (Hungary), London (Canada), Como (Italy), Las Cruces (New Mexico, USA), Nový Smokovec (Slovakia), Charlottetown (Prince Edward Island, Canada), Magdeburg (Germany), Saskatoon (Saskatchewan, Canada), Gießen/Limburg (Germany) and Braga (Portugal). Within the general theme of descriptional complexity of formal systems the topics covered by DCFS include the following (as listed in the 2013 call for papers): Automata, grammars, languages and other formal systems; various modes of operations and complexity measures; co-operating systems. Succinctness of the description of objects, state-explosion-like phenomena. Circuit complexity of Boolean functions and related measures. Size complexity and structural complexity of formal systems. Trade-offs between computational models and modes of operation. Applications of formal systems for instance, in software and hardware testing, in dialogue systems, in systems modelling or in modelling natural languages and their complexity constraints. Size or structural complexity of formal systems for modelling natural languages. Complexity aspects related to the combinatorics of words. Descriptional complexity in resource-bounded or structure-bounded environments. Structural complexity as related to descriptional complexity. Frontiers between decidability and undecidability. Universality and reversibility. Nature-motivated (bio-inspired) architectures and unconventional models of computing. Kolmogorov-Chaitin complexity, algorithmic information. The workshop programme of DCFS 2013 included four invited lectures, 22 contributed papers, discussion sessions and an excursion to one of the nature resorts

5 VI Preface in the vicinity of London. The proceedings of DCFS 2013, which are published in this volume of the Lecture Notes in Computer Science series and which were available at the workshop, contain the invited lectures and the contributed papers. Submissions to DCFS 2013 came from 46 authors from many different countries including Canada, the Czech Republic, Finland, France, Germany, India, the Islamic Republic of Iran, Italy, the Republic of Korea, Malaysia, Morocco, Portugal, Slovakia and the USA. On the basis of three reviews for each contribution, an international committee selected the papers for inclusion in the workshop programme and this proceedings volume. We gratefully acknowledge generous financial support from the Fields Institute for Research in Mathematical Sciences. It was crucial, covering the expenses for invited speakers and offering some modest travel assistance to junior researchers. We also received direct financial support from the Faculty of Science of Western University and valuable in-kind support from the Department of Computer Science and in the form of free proceedings volumes from Springer. Without this support, it would have been very difficult to conduct DCFS We are thankful for this help. We also say thanks to those who contributed otherwise to the success of DCFS 2013: The invited speakers Cezar Câmpeanu (University of Prince Edward Island, Canada), Frank Drewes (Umeå Universitet, Sweden), Pierre McKenzie (UniversitédeMontréal, Canada) and Klaus Sutner (Carnegie Mellon University, Pittsburgh, USA). The authors of contributed and discussion papers. The speakers and participants of the workshop. The reviewers and the programme committee. The people looking after the organizational details, in particular, Cheryl McGrath, Andrew Szilard, Roopa Bose and Feliks Rozenberg of the local organization committee. The staff of the Computer Science Department and of the Grad Club at Western University. We also thank Springer and, in particular, their Computer Science Editorial, for the extremely helpful and efficient collaboration in making this volume available before the conference. As volume editors we value their experience and advice. We hope that, as in previous years, DCFS 2013 has initiated scientific discussions and stimulated research and scientific co-operation in the area of descriptional complexity, and that this volume contributes to raising the interest in the field. We look forward to seeing this year s participants and many others at DCFS in 2014! July 2013 Helmut Jürgensen Rogério Reis

6 Organization Programme Committee Viliam Geffert Galina Jirásková Helmut Jürgensen Christos Kapoutsis Lila Kari Stavros Konstantinidis Dexter Kozen Martin Kutrib Andreas Malcher Ian McQuillan Victor Mitrana Nelma Moreira Beatrice Palano Giovanni Pighizzini Rogério Reis Jacques Sakarovitch Kai Salomaa Jeffrey Shallit Bianca Truthe Univerzita Pavol Jozefa Šafárika, Košice, Slovakia Slovenskáakadémia vied, Košice, Slovakia Western University, London, Canada Carnegie Mellon University in Qatar Western University, London, Canada Saint Mary s University, Halifax, Canada Cornell University, Ithaca, USA Justus-Liebig-Universität, Gießen, Germany Justus-Liebig-Universität, Gießen, Germany University of Saskatchewan, Saskatoon, Canada Universidad Politécnica de Madrid, Madrid, Spain Universidade do Porto, Portugal Università degli Studi di Milano, Italy Università degli Studi di Milano, Italy Universidade do Porto, Portugal CNRS / ENST, Paris, France Queen s University, Kingston, Canada University of Waterloo, Waterloo, Canada Otto-von-Guericke-Universität, Magdeburg, Germany Additional Reviewers Amorim, Ivone Autebert, Jean-Michel Bednárová, Zuzana Bianchi, Maria Paola Bordihn, Henning Broda, Sabine Cherubini, Alessandra Enaganti, Srujan Holzer, Markus Jakobi, Sebastian Karamichalis, Rallis Klíma, Ondřej Kulkarni, Manasi Lombardy, Sylvain Maia, Eva Manea, Florin Masopust, Tomáš Meckel, Katja Mereghetti, Carlo Nabais, Davide Palioudakis, Alexandros Šebej, Juraj de Souza, Rodrigo Szilard, Andrew Wendlandt, Matthias

7 Table of Contents Blum Static Complexity and Encoding Spaces... 1 Cezar Câmpeanu Millstream Systems and Graph Transformation for Complex Linguistic Models Frank Drewes Can Chimps Go It Alone? Pierre McKenzie Invertible Transductions and Iteration Klaus Sutner Universal Witnesses for State Complexity of Boolean Operations and Concatenation Combined with Star Janusz Brzozowski and David Liu Searching for Traces of Communication in Szilard Languages of Parallel Communicating Grammar Systems - Complexity Views Liliana Cojocaru and Erkki Mäkinen State Complexity of Basic Operations on Non-returning Regular Languages Hae-Sung Eom, Yo-Sub Han, and Galina Jirásková State Complexity of Subtree-Free Regular Tree Languages Hae-Sung Eom, Yo-Sub Han, and Sang-Ki Ko State Complexity of k-union and k Intersection for Prefix-Free Regular Languages Hae-Sung Eom, Yo-Sub Han, and Kai Salomaa A Direct Construction of Finite State Automata for Pushdown Store Languages Viliam Geffert, Andreas Malcher, Katja Meckel, Carlo Mereghetti, and Beatrice Palano Nondeterministic State Complexity of Proportional Removals Daniel Goč, Alexandros Palioudakis, and Kai Salomaa Nondeterministic Biautomata and Their Descriptional Complexity Markus Holzer and Sebastian Jakobi

8 X Table of Contents Queue Automata of Constant Length Sebastian Jakobi, Katja Meckel, Carlo Mereghetti, and Beatrice Palano On the State Complexity of the Reverse of R- andj -Trivial Regular Languages Galina Jirásková and Tomáš Masopust Size of Unary One-Way Multi-head Finite Automata Martin Kutrib, Andreas Malcher, and Matthias Wendlandt Syntactic Complexity of R- andj -Trivial Regular Languages Janusz Brzozowski and Baiyu Li Sophistication as Randomness Deficiency Francisco Mota, Scott Aaronson, Luís Antunes, and André Souto Shortest Repetition-Free Words Accepted by Automata Hamoon Mousavi and Jeffrey Shallit A Characterisation of NL/poly via Nondeterministic Finite Automata Rob Myers and Henning Urbat Improved Normal Form for Grammars with One-Sided Contexts Alexander Okhotin Comparisons between Measures of Nondeterminism on Finite Automata Alexandros Palioudakis, Kai Salomaa, and Selim G. Akl Finite Nondeterminism vs. DFAs with Multiple Initial States Alexandros Palioudakis, Kai Salomaa, and Selim G. Akl The Power of Centralized PC Systems of Pushdown Automata Holger Petersen Limited Automata and Regular Languages Giovanni Pighizzini and Andrea Pisoni Reversal on Regular Languages and Descriptional Complexity Juraj Šebej Kleene Star on Unary Regular Languages Kristína Čevorová Author Index