Lecture Notes in Computer Science 7982

Transcription

1 Lecture Notes in Computer Science 7982 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 Stavros Konstantinidis (Ed.) Implementation and Application of Automata 18th International Conference, CIAA 2013 Halifax, NS, Canada, July 16-19, 2013 Proceedings 13

3 Volume Editor Stavros Konstantinidis Saint Mary s University Department of Mathematics and Computing Science 923 Robie Street Halifax, NS B3H 3C3, Canada s.konstantinidis@smu.ca 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-2, F.1, F.2, F.4, E.1, H.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 This volume contains the papers presented at the 18th International Conference on Implementation and Application of Automata (CIAA 2013), which was held at Saint Mary s University in Halifax, Nova Scotia, Canada, during July The CIAA conference series is a major international venue for the dissemination of new results in the implementation, application, and theory of automata. The previous 17 conferences were held in the following locations: Porto (2012), Blois (2011), Winnipeg (2010), Sydney (2009), San Francisco (2008), Prague (2007), Taipei (2006), Nice (2005), Kingston (2004), Santa Barbara (2003), Tours (2002), Pretoria (2001), London Ontario (2000), Potsdam (WIA 1999), Rouen (WIA 1998), London Ontario (WIA 1997 and WIA 1996). The topics of this volume include: complexity of automata, compressed automata, counter automata, dictionary matching, edit distance, homing sequences, implementation, minimization of automata, model checking, parsing of regular expressions, partial word automata, picture languages, pushdown automata, queue automata, reachability analysis for software verification, restarting automata, transducers, tree automata, weighted automata, XML streams. The submission and refereeing process was supported by the EasyChair conference system. In all, 43 papers were submitted by authors in 22 different countries (from all six habitable continents), including Algeria, Bangladesh, Canada, Czech Republic, Denmark, France, Germany, Italy, Japan, Korea Republic, Poland, Portugal, Russian Federation, Slovakia, and the USA. Each paper was reviewed by at least three Program Committee members. The Program Committee selected 25 regular papers and three short papers for presentation at the conference and publication in this volume. There were three invited talks by Cezar Câmpeanu, Helmut Jürgensen, and Margus Veanes. We are very thankful to all invited speakers, contributing authors, Program Committee members, and external referees for their valuable contributions toward the realization of CIAA We also thank Alfred Hofmann and Anna Kramer of Springer for their guidance during the process of publishing this volume. We are grateful to (a) the European Association for Theoretical Computer Science (EATCS) for their scientific sponsorship, (b) to Microsoft Research, and the Dean of Science and the Academic Vice President of Saint Mary s University (SMU) for their financial support, and (c) to Destination Halifax for their assistance in arranging the accommodation and excursion venues.

5 VI Preface Finally, we are indebted to the Organizing Committee members Casey Meijer and Rose Daurie, as well as to the research students of the department of Mathematics and Computing Science at Saint Mary s University, Halifax. We are looking forward to the next CIAA in Giessen, Germany. July 2013 Stavros Konstantinidis

6 Organization CIAA 2013 was organized at the Department of Mathematics and Computing Science, Saint Mary s University, Halifax, Canada. Invited Speakers Câmpeanu, Cezar Jürgensen, Helmut Veanes, Margus University of PEI, Canada University of Western Ontario, Canada Microsoft Research, USA Program Committee Brzozowski, Janusz Câmpeanu, Cezar Caron, Pascal Champarnaud, Jean-Marc Domaratzki, Michael Drewes, Frank Han, Yo-Sub Holub, Jan Holzer, Markus Ibarra, Oscar Ito, Masami Jürgensen, Helmut Kari, Lila Konstantinidis, Stavros (Chair) Lombardy, Sylvain Maletti, Andreas Maneth, Sebastian Maurel, Denis McQuillan, Ian Moreira, Nelma Okhotin, Alexander Pighizzini, Giovanni Ravikumar, Bala Reidenbach, Daniel Reis, Rogerio Salomaa, Kai Tommasi, Marc Waterloo, Canada Charlottetown, Canada Rouen, France Rouen, France Manitoba, Canada Umea, Sweden Seoul, Korea Prague, Czech Republic Giessen, Germany Santa Barbara, California, USA Kyoto, Japan London, Canada London, Canada Halifax, Canada Bordeaux, France Stuttgart, Germany New South Wales, Australia Tours, France Saskatoon, Canada Porto, Portugal Turku, Finland Milan, Italy Rohnert Park CA, USA Leicestershire, UK Porto, Portugal Kingston, Canada Lille, France

7 VIII Organization Volkov, Mikhail Watson, Bruce Yen, Hsu-Chun Ekaterinburg, Russian Federation Stellenbosch University, South Africa Taipei, Taiwan External Referees Amorim, Ivone Baier, Jan Barash, Mikhail Becerra Bonache, Leonor Bertoni, Alberto Björklund, Henrik Björklund, Johanna Boneva, Iovka Borchert, Bernd Broda, Sabine Carayol, Arnaud Cerno, Peter Cleophas, Loek David, Julien Day, Joel Dubernard, Jean-Philippe Fraser, Gordon Freydenberger, Dominik D. Friburger, Nathalie Gao, Yuan Groz, Benoît Jeż, Artur Khoussainov, Bakhadyr Klimann, Ines Kobayashi, Yuji Kolpakov, Roman Kopecki, Steffen Kourie, Derrick Kutrib, Martin Lemay, Aurelien Liu, Jiamou Lucanu, Dorel Maia, Eva Malcher, Andreas Mignot, Ludovic Nagy, Benedek Nicart, Florent Niehren, Joachim Nouvel, Damien Oshita, Masaki Palioudakis, Alexandros Polach, Radomir Quernheim, Daniel Rampersad, Narad Reinhardt, Klaus Roche, Abiel Roche-Lima, Abiel Rodaro, Emanuele Savari, Serap Schmid, Markus L. Seki, Shinnosuke Simjour, Amir Strauss, Tinus Tran, Nicholas Wang, Bow-Yaw Young, Joshua Steering Committee Champarnaud, Jean-Marc Holzer, Markus Ibarra, Oscar Maurel, Denis Salomaa, Kai T. (Chair) Yen, Hsu-Chun Rouen, France Giessen, Germany Santa Barbara, California, USA Tours, France Kingston, Ontario, Canada Taipei, Taiwan

8 Organization IX Organizing Committee Daurie, Rose Konstantinidis, Stavros (Chair) Meijer, Casey Halifax, Canada Halifax, Canada Halifax, Canada Sponsors Academic Vice President, Saint Mary s University Dean of Science, Saint Mary s University Destination Halifax European Association for Theoretical Computer Science Microsoft Research

9 Table of Contents Invited Talks Cover Languages and Implementations... 1 Cezar Câmpeanu Automata for Codes... 2 Helmut Jürgensen Applications of Symbolic Finite Automata Margus Veanes Regular Papers Computing Weights Houda Abbad and Éric Laugerotte Partial Word DFAs Eric Balkanski, F. Blanchet-Sadri, Matthew Kilgore, and B.J. Wyatt Using Regular Grammars for Event-Based Testing Fevzi Belli and Mutlu Beyazıt Two-Pass Greedy Regular Expression Parsing Niels Bjørn Bugge Grathwohl, Fritz Henglein, Lasse Nielsen, and Ulrik Terp Rasmussen Universal Witnesses for State Complexity of Basic Operations Combined with Reversal Janusz Brzozowski and David Liu Trimming Visibly Pushdown Automata Mathieu Caralp, Pierre-Alain Reynier, and Jean-Marc Talbot A Uniformization Theorem for Nested Word to Word Transductions Dmitry Chistikov and Rupak Majumdar Towards Nominal Context-Free Model-Checking Pierpaolo Degano, Gian-Luigi Ferrari, and Gianluca Mezzetti Implementation Concepts in Vaucanson Akim D le, Alexandre Duret-Lutz, Sylvain Lombardy, and Jacques Sakarovitch A Completion Algorithm for Lattice Tree Automata Thomas Genet, Tristan Le Gall, Axel Legay, and Valérie Murat

10 XII Table of Contents Approximate Matching between a Context-Free Grammar and a Finite-State Automaton Yo-Sub Han, Sang-Ki Ko, and Kai Salomaa On Palindromic Sequence Automata and Applications Md. Mahbubul Hasan, A.S.M. Sohidull Islam, M. Sohel Rahman, and Ayon Sen LALBLC A Program Testing the Equivalence of dpda s Patrick Henry and Géraud Sénizergues Brzozowski s Minimization Algorithm More Robust than Expected (Extended Abstract) Markus Holzer and Sebastian Jakobi Some Decision Problems Concerning NPDAs, Palindromes, and Dyck Languages Oscar H. Ibarra and Bala Ravikumar On the Boundary of Regular Languages Jozef Jirásek and Galina Jirásková On the Length of Homing Sequences for Nondeterministic Finite State Machines Natalia Kushik and Nina Yevtushenko Input-Driven Queue Automata: Finite Turns, Decidability, and Closure Properties Martin Kutrib, Andreas Malcher, Carlo Mereghetti, Beatrice Palano, and Matthias Wendlandt Hyper-optimization for Deterministic Tree Automata Andreas Maletti Lambda-Confluence Is Undecidable for Clearing Restarting Automata František Mráz and Friedrich Otto Comparing Two-Dimensional One-Marker Automata to Sgraffito Automata Daniel Průša, František Mráz, and Friedrich Otto Deterministic Counter Machines and Parallel Matching Computations Stefano Crespi Reghizzi and Pierluigi San Pietro Early Nested Word Automata for XPath Query Answering on XML Streams Denis Debarbieux, Olivier Gauwin, Joachim Niehren, Tom Sebastian, and Mohamed Zergaoui

11 Table of Contents XIII Invertible Transducers, Iteration and Coordinates Klaus Sutner Compressed Automata for Dictionary Matching Tomohiro I, Takaaki Nishimoto, Shunsuke Inenaga, Hideo Bannai, and Masayuki Takeda Short Papers Enhancing Approximations for Regular Reachability Analysis Aloïs Dreyfus, Pierre-Cyrille Héam, and Olga Kouchnarenko Generating Small Automata and the Černý Conjecture Andrzej Kisielewicz and Marek Szyku la Incomplete Transition Complexity of Basic Operations on Finite Languages Eva Maia, Nelma Moreira, and Rogério Reis Author Index