Developments in Language Theory

17th International Conference, DLT 2013, Marne-la-Vallée, France, June 18-21, 2013. Proceedings

  • Marie-Pierre Béal
  • Olivier Carton
Part of the Lecture Notes in Computer Science book series (LNCS, volume 7907)

Table of contents

  1. Front Matter
  2. Invited Talks

  3. Regular Papers

    1. Marcella Anselmo, Dora Giammarresi, Maria Madonia
      Pages 46-57
    2. Mohamed Faouzi Atig, K. Narayan Kumar, Prakash Saivasan
      Pages 58-69
    3. Martin Berglund, Henrik Björklund, Frank Drewes, Brink van der Merwe, Bruce Watson
      Pages 70-81
    4. Alberto Bertoni, Christian Choffrut, Flavio D’Alessandro
      Pages 82-93
    5. Francine Blanchet-Sadri, Nathan Fox
      Pages 94-105
    6. Francine Blanchet-Sadri, Brent Woodhouse
      Pages 106-117
    7. Benedikt Bollig, Peter Habermehl, Martin Leucker, Benjamin Monmege
      Pages 118-130
    8. Silvia Bonomo, Sabrina Mantaci, Antonio Restivo, Giovanna Rosone, Marinella Sciortino
      Pages 131-142
    9. James D. Currie, Narad Rampersad, Kalle Saari
      Pages 143-154
    10. Jürgen Dassow, Florin Manea, Robert Mercaş, Mike Müller
      Pages 155-166
    11. Joel D. Day, Daniel Reidenbach, Johannes C. Schneider
      Pages 167-178
    12. Aldo de Luca, Elena V. Pribavkina, Luca Q. Zamboni
      Pages 191-202

About these proceedings

Introduction

This book constitutes the proceedings of the 17th International Conference on Developments in Language Theory, DLT 2013, held in Marne-la-Vallée, France, in June 2013. The 34 full papers presented in this volume were carefully reviewed and selected from 63 submissions. The scope of the conference 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 automata and languages; codes; efficient text algorithms; symbolic dynamics; decision problems; relationships to complexity theory and logic; picture description and analysis; polyominoes and bidimensional patterns; cryptography; concurrency; cellular automata; bio-inspired computing; and quantum computing.

Keywords

alphabet context-free languages finite automata regular expressions regular languages

Editors and affiliations

  • Marie-Pierre Béal
    • 1
  • Olivier Carton
    • 2
  1. 1.LIGMUniversity Paris-Est Marne-la-ValléeMarne-la-Vallée Cedex 2France
  2. 2.LIAFA, UMR 7089University Paris DiderotParis cedex 13France

Bibliographic information

  • DOI https://doi.org/10.1007/978-3-642-38771-5
  • Copyright Information Springer-Verlag Berlin Heidelberg 2013
  • Publisher Name Springer, Berlin, Heidelberg
  • eBook Packages Computer Science
  • Print ISBN 978-3-642-38770-8
  • Online ISBN 978-3-642-38771-5
  • Series Print ISSN 0302-9743
  • Series Online ISSN 1611-3349