Developments in Language Theory

7th International Conference, DLT 2003 Szeged, Hungary, July 7–11, 2003 Proceedings

  • Zoltán Ésik
  • Zoltán Fülöp
Conference proceedings DLT 2003

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

Table of contents

  1. Front Matter
    Pages I-XI
  2. Invited Presentations

    1. Alberto Bertoni, Carlo Mereghetti, Beatrice Palano
      Pages 1-20
    2. Ferenc Gécseg
      Pages 22-34
    3. Antonio Cano Gómez, Jean-Éric Pin
      Pages 35-54
    4. Wojciech Plandowski
      Pages 75-94
    5. Heribert Vollmer
      Pages 95-110
  3. Contributions

    1. Dimitry S. Ananichev, Mikhail V. Volkov
      Pages 111-121
    2. Marcella Anselmo, Maria Madonia
      Pages 122-133
    3. Paola Bonizzoni, Clelia De Felice, Giancarlo Mauri, Rosalba Zizza
      Pages 134-145
    4. Anne Bouillard, Jean Mairesse
      Pages 159-170
    5. Julien Carme, Rémi Gilleron, Aurélien Lemay, Alain Terlutte, Marc Tommasi
      Pages 171-182
    6. Pascal Caron, Marianne Flouret
      Pages 183-193
    7. Jean-Marc Champarnaud, Fabien Coulon
      Pages 194-205
    8. Stefano Crespi Reghizzi, Matteo Pradella
      Pages 206-217
    9. Erzsébet Csuhaj-Varjú, Victor Mitrana, György Vaszil
      Pages 218-229
    10. Flavio D’Alessandro, Stefano Varricchio
      Pages 230-241
    11. Diego de Falco, Massimiliano Goldwurm, Violetta Lonati
      Pages 242-253

About these proceedings

Introduction

 

This book constitutes the refereed proceedings of the 7th International Conference on Developments in Language Theory, DLT 2003, held in Szeged, Hungary, in July 2003.

The 27 revised full papers presented together with 7 invited papers were carefully reviewed and selected from 57 submissions. All current aspects in language theory are addressed, in particular grammars, acceptors, and transducers for strings, trees, graphs, arrays, etc; algebraic theories for automata and languages; combinatorial properties of words and languages; formal power series; decision problems; efficient algorithms for automata and languages; and relations to complexity theory and logic, picture description and analysis, DNA computing, quantum computing, cryptography, and concurrency.

Keywords

Algorithms Automat algorithm automata complexity complexity theory logic

Editors and affiliations

  • Zoltán Ésik
    • 1
  • Zoltán Fülöp
    • 1
  1. 1.Department of InformaticsUniversity of SzegedSzegedHungary

Bibliographic information

  • DOI https://doi.org/10.1007/3-540-45007-6
  • Copyright Information Springer-Verlag Berlin Heidelberg 2003
  • Publisher Name Springer, Berlin, Heidelberg
  • eBook Packages Springer Book Archive
  • Print ISBN 978-3-540-40434-7
  • Online ISBN 978-3-540-45007-8
  • Series Print ISSN 0302-9743
  • About this book