Skip to main content
  • Conference proceedings
  • © 2003

Developments in Language Theory

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

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

Conference series link(s): DLT: International Conference on Developments in Language Theory

Conference proceedings info: DLT 2003.

Buy it now

Buying options

eBook USD 39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book USD 54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Other ways to access

This is a preview of subscription content, log in via an institution to check for access.

Table of contents (34 papers)

  1. Front Matter

    Pages I-XI
  2. Invited Presentations

    1. Quantum Computing: 1-Way Quantum Automata

      • Alberto Bertoni, Carlo Mereghetti, Beatrice Palano
      Pages 1-20
    2. Comments on Complete Sets of Tree Automata

      • Ferenc Gécseg
      Pages 22-34
    3. On a Conjecture of Schnoebelen

      • Antonio Cano Gómez, Jean-Éric Pin
      Pages 35-54
    4. Test Sets for Large Families of Languages

      • Wojciech Plandowski
      Pages 75-94
    5. Complexity Theory Made Easy

      • Heribert Vollmer
      Pages 95-110
  3. Contributions

    1. Synchronizing Monotonic Automata

      • Dimitry S. Ananichev, Mikhail V. Volkov
      Pages 111-121
    2. Covering Problems from a Formal Language Point of View

      • Marcella Anselmo, Maria Madonia
      Pages 122-133
    3. Regular Languages Generated by Reflexive Finite Splicing Systems

      • Paola Bonizzoni, Clelia De Felice, Giancarlo Mauri, Rosalba Zizza
      Pages 134-145
    4. Generating Series of the Trace Group

      • Anne Bouillard, Jean Mairesse
      Pages 159-170
    5. Residual Finite Tree Automata

      • Julien Carme, Rémi Gilleron, Aurélien Lemay, Alain Terlutte, Marc Tommasi
      Pages 171-182
    6. From Glushkov WFAs to Rational Expressions

      • Pascal Caron, Marianne Flouret
      Pages 183-193
    7. NFA Reduction Algorithms by Means of Regular Inequalities

      • Jean-Marc Champarnaud, Fabien Coulon
      Pages 194-205
    8. Tile Rewriting Grammars

      • Stefano Crespi Reghizzi, Matteo Pradella
      Pages 206-217
    9. Distributed Pushdown Automata Systems: Computational Power

      • Erzsébet Csuhaj-Varjú, Victor Mitrana, György Vaszil
      Pages 218-229
    10. On Well Quasi-orders on Languages

      • Flavio D’Alessandro, Stefano Varricchio
      Pages 230-241
    11. Frequency of Symbol Occurrences in Simple Non-primitive Stochastic Models

      • Diego de Falco, Massimiliano Goldwurm, Violetta Lonati
      Pages 242-253

Other Volumes

  1. Developments in Language Theory

About this book

 

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.

Editors and Affiliations

  • Department of Informatics, University of Szeged, Szeged, Hungary

    Zoltán Ésik, Zoltán Fülöp

Bibliographic Information

Buy it now

Buying options

eBook USD 39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book USD 54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Other ways to access