Developments in Language Theory

18th International Conference, DLT 2014, Ekaterinburg, Russia, August 26-29, 2014. Proceedings

  • Arseny M. Shur
  • Mikhail V. Volkov
Conference proceedings DLT 2014

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

Table of contents

  1. Front Matter
  2. Finite Automata and Regular Languages

    1. Dmitry Berdinsky, Bakhadyr Khoussainov
      Pages 1-12
    2. Janusz Brzozowski, Marek Szykuła
      Pages 13-24
    3. Yo-Sub Han, Sang-Ki Ko, Kai Salomaa
      Pages 37-48
    4. Jorge Almeida, Emanuele Rodaro
      Pages 49-60
    5. Vladimir V. Gusev
      Pages 68-75
  3. Pushdown Automata and Related Models

    1. Alexander Okhotin, Kai Salomaa
      Pages 84-102
    2. Joost Engelfriet, Sebastian Maneth, Helmut Seidl
      Pages 103-115
    3. Salvatore La Torre, Margherita Napoli, Gennaro Parlato
      Pages 116-128
    4. Pierre-Alain Reynier, Jean-Marc Talbot
      Pages 129-141
  4. Combinatorics and Algorithmics on Words

    1. Bruno Durand, Guilhem Gamard, Anaël Grandjean
      Pages 166-177
    2. Thorsten Ehlers, Florin Manea, Robert Mercaş, Dirk Nowotka
      Pages 178-190
    3. Juhani Karhumäki, Svetlana Puzynina
      Pages 191-202
    4. Juhani Karhumäki, Aleksi Saarela, Luca Q. Zamboni
      Pages 203-214
    5. Tomasz Kociumaka, Jakub Radoszewski, Wojciech Rytter, Tomasz Waleń
      Pages 215-226

About these proceedings


This book constitutes the proceedings of the 18th International Conference on Developments in Language Theory, DLT 2014, held in Ekaterinburg, Russia, in August 2014.
The 22 full papers and 5 short papers presented together with 3 invited talks were carefully reviewed and selected from 38 submissions. The papers are organized in topical subjects on Grammars, Acceptors and Transducers for Words, Trees and Graphs, Algebraic Theories of Automata, Algorithmic, Combinatorial and Algebraic Properties of Words and Languages, Variable Length Codes, Symbolic Dynamics, Cellular
Automata,  Polyominoes and Multidimensional Patterns,  Decidability Questions, Image Manipulation and Compression, Efficient Text Algorithms, Relationships to Cryptography, Concurrency, Complexity Theory and Logic,  Bio-Inspired Computing, and Quantum Computing.


algebraic language theory cellular automata context-free languages decidability and complexity in language theory finite automata formal languages and automata theory quantum computing regular expressions regular languages transducers tree languages

Editors and affiliations

  • Arseny M. Shur
    • 1
  • Mikhail V. Volkov
    • 1
  1. 1.Institute of Mathematics and Computer ScienceUral Federal UniversityEkaterinburgRussia

Bibliographic information

  • DOI
  • Copyright Information Springer International Publishing Switzerland 2014
  • Publisher Name Springer, Cham
  • eBook Packages Computer Science
  • Print ISBN 978-3-319-09697-1
  • Online ISBN 978-3-319-09698-8
  • Series Print ISSN 0302-9743
  • Series Online ISSN 1611-3349
  • About this book