Developments in Language Theory

20th International Conference, DLT 2016, Montréal, Canada, July 25-28, 2016, Proceedings

  • Srečko Brlek
  • Christophe Reutenauer
Conference proceedings DLT 2016
Part of the Lecture Notes in Computer Science book series (LNCS, volume 9840)

Table of contents

  1. Front Matter
    Pages I-XVII
  2. Devendra Bhave, Vrunda Dave, S. N. Krishna, Ramchandra Phawade, Ashutosh Trivedi
    Pages 38-50
  3. Sabine Broda, António Machiavelo, Nelma Moreira, Rogério Reis
    Pages 51-63
  4. Michaël Cadilhac, Andreas Krebs, Klaus-Jörn Lange
    Pages 64-76
  5. Julien Cassaigne, Juhani Karhumäki, Svetlana Puzynina, Markus A. Whiteland
    Pages 77-88
  6. Liang-Ting Chen, Henning Urbat
    Pages 89-101
  7. Da-Jung Cho, Yo-Sub Han, Timothy Ng, Kai Salomaa
    Pages 102-113
  8. Christian Choffrut, Bruno Guillon
    Pages 114-124
  9. Luc Dartois, Ismaël Jecker, Pierre-Alain Reynier
    Pages 125-137
  10. Jörg Endrullis, Juhani Karhumäki, Jan Willem Klop, Aleksi Saarela
    Pages 164-176
  11. Daniil Gasnikov, Arseny M. Shur
    Pages 177-189
  12. Luisa Herrmann, Heiko Vogler
    Pages 203-215
  13. Oscar H. Ibarra, Ian McQuillan
    Pages 216-228

About these proceedings

Introduction

This book constitutes the proceedings of the 20th International Conference on Developments in Language Theory, DLT 2016, held in Montreal, QC, Canada, in July 2016.

The 32 full papers and 4 abstracts of invited papers presented were carefully reviewed and selected from 48 submissions. This volume presents current developments in formal languages and automata, especially from 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 bidimentional patterns; cryptography; concurrency; cellular automata; bio-inspried computing; quantum computing.

Keywords

computational complexity language operations perfect languages streaming turing transducers automata bounded languages combinatorics on words context-sensitive languages hyperwords independent systems infinite graphs NP-hardness ordered rewriting quantitative tree automata regular languages timed languages transducer weighted tree automata

Editors and affiliations

  • Srečko Brlek
    • 1
  • Christophe Reutenauer
    • 2
  1. 1.Université du Québec à Montréal MontrealCanada
  2. 2.Dept MathematiquesUniv du Quebec Montreal Dept MathematiquesMontrealCanada

Bibliographic information

  • DOI https://doi.org/10.1007/978-3-662-53132-7
  • Copyright Information Springer-Verlag Berlin Heidelberg 2016
  • Publisher Name Springer, Berlin, Heidelberg
  • eBook Packages Computer Science
  • Print ISBN 978-3-662-53131-0
  • Online ISBN 978-3-662-53132-7
  • Series Print ISSN 0302-9743
  • Series Online ISSN 1611-3349
  • About this book