Developments in Language Theory

21st International Conference, DLT 2017, Liège, Belgium, August 7-11, 2017, Proceedings

  • Émilie Charlier
  • Julien Leroy
  • Michel Rigo
Conference proceedings DLT 2017

Part of the Lecture Notes in Computer Science book series (LNCS, volume 10396)

Also part of the Theoretical Computer Science and General Issues book sub series (LNTCS, volume 10396)

Table of contents

  1. Front Matter
    Pages I-XXIII
  2. Invited Talks

  3. Regular Papers

    1. Front Matter
      Pages 81-81
    2. Simon Beier, Markus Holzer
      Pages 83-95
    3. Simon Beier, Markus Holzer, Martin Kutrib
      Pages 96-108
    4. Vincent Hugot, Adrien Boiret, Joachim Niehren
      Pages 109-121
    5. Michiel de Bondt, Henk Don, Hans Zantema
      Pages 122-133
    6. Sabine Broda, Markus Holzer, Eva Maia, Nelma Moreira, Rogério Reis
      Pages 134-146
    7. Olivier Carton, Léo Exibard, Olivier Serre
      Pages 147-159
    8. Jörg Endrullis, Jeffrey Shallit, Tim Smith
      Pages 160-172
    9. Zsolt Gazdag, Krisztián Tichler
      Pages 173-184
    10. François Gonze, Vladimir V. Gusev, Balázs Gerencsér, Raphaël M. Jungers, Mikhail V. Volkov
      Pages 185-197
    11. Michal Hospodár, Galina Jirásková, Peter Mlynárčik
      Pages 222-234

About these proceedings

Introduction

This book constitutes the proceedings of the 21st International Conference on Developments in Language Theory, DLT 2017, held in Liège, Belgium, in August 2017.The 24 full papers and 6 (abstract of)  invited papers were carefully reviewed and selected from 47 submissions. The papers cover the following topics and areas: combinatorial and algebraic properties  of words and languages; grammars acceptors and transducers for strings, trees, graphics, 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; celluar automata; bio-inspiredcomputing; quantum computing.

Keywords

Formal languages and automata theory Grammars and context-free languages Tree languages Transducers Regular languages Complexity theory and logic Logic and verification Proof theory Modal and temporal logics Combinatorics on words Graph theory Trees Complexity classes Problems, reductions and completeness Proof complexity Complexity theory and logic Number-theoretic computations Algorithmic game theory Model checking

Editors and affiliations

  • Émilie Charlier
    • 1
  • Julien Leroy
    • 2
  • Michel Rigo
    • 3
  1. 1.Université de LiègeLiègeBelgium
  2. 2.Université de LiègeLiègeBelgium
  3. 3.Université de LiègeLiègeBelgium

Bibliographic information

  • DOI https://doi.org/10.1007/978-3-319-62809-7
  • Copyright Information Springer International Publishing AG 2017
  • Publisher Name Springer, Cham
  • eBook Packages Computer Science
  • Print ISBN 978-3-319-62808-0
  • Online ISBN 978-3-319-62809-7
  • Series Print ISSN 0302-9743
  • Series Online ISSN 1611-3349
  • About this book