Skip to main content
SpringerLink
Log in
Book cover

Developments in Language Theory

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

  • Conference proceedings
  • © 2003

Overview

Editors:
  1. Zoltán Ésik

    1. Department of Informatics, University of Szeged, Szeged, Hungary

    View editor publications

    You can also search for this editor in PubMed   Google Scholar

  2. Zoltán Fülöp

    1. Department of Informatics, University of Szeged, Szeged, Hungary

    View editor publications

    You can also search for this editor in PubMed   Google Scholar

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

Included in the following conference series:

Conference proceedings info: DLT 2003.

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

Access this book

Log in via an institution
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

Licence this eBook for your library

Institutional subscriptions

Table of contents (34 papers)

  1. Front Matter

    Pages I-XI
    Download chapter PDF

  2. Invited Presentations

    1. Quantum Computing: 1-Way Quantum Automata

      • Alberto Bertoni, Carlo Mereghetti, Beatrice Palano
      Pages 1-20

    2. An Automata-Theoretic Approach to Software Verification

      • Javier Esparza
      Pages 21-21

    3. Comments on Complete Sets of Tree Automata

      • Ferenc Gécseg
      Pages 22-34

    4. On a Conjecture of Schnoebelen

      • Antonio Cano Gómez, Jean-Éric Pin
      Pages 35-54

    5. Restarting Automata and Their Relations to the Chomsky Hierarchy

      • Friedrich Otto
      Pages 55-74

    6. Test Sets for Large Families of Languages

      • Wojciech Plandowski
      Pages 75-94

    7. 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. The Myhill-Nerode Theorem for Recognizable Tree Series

      • Björn Borchardt
      Pages 146-158

    5. Generating Series of the Trace Group

      • Anne Bouillard, Jean Mairesse
      Pages 159-170

    6. Residual Finite Tree Automata

      • Julien Carme, Rémi Gilleron, Aurélien Lemay, Alain Terlutte, Marc Tommasi
      Pages 171-182

    7. From Glushkov WFAs to Rational Expressions

      • Pascal Caron, Marianne Flouret
      Pages 183-193

    8. NFA Reduction Algorithms by Means of Regular Inequalities

      • Jean-Marc Champarnaud, Fabien Coulon
      Pages 194-205

    9. Tile Rewriting Grammars

      • Stefano Crespi Reghizzi, Matteo Pradella
      Pages 206-217

    10. Distributed Pushdown Automata Systems: Computational Power

      • Erzsébet Csuhaj-Varjú, Victor Mitrana, György Vaszil
      Pages 218-229

    11. On Well Quasi-orders on Languages

      • Flavio D’Alessandro, Stefano Varricchio
      Pages 230-241

    12. Frequency of Symbol Occurrences in Simple Non-primitive Stochastic Models

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

Other volumes

  1. Developments in Language Theory

Keywords

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

Publish with us

Policies and ethics

Back to top

Search

Navigation