Skip to main content
  • Conference proceedings
  • © 2006

Developments in Language Theory

10th International Conference, DLT 2006, Santa Barbara, CA, USA, June 26-29, 2006, Proceedings

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

Part of the book sub series: Theoretical Computer Science and General Issues (LNTCS)

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

Conference proceedings info: DLT 2006.

Buying options

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

Tax calculation will be finalised at checkout

Purchases are for personal use only

Learn about institutional subscriptions

This is a preview of subscription content, access via your institution.

Table of contents (40 papers)

  1. Front Matter

  2. Invited Lectures

    1. Adding Nesting Structure to Words

      • Rajeev Alur, P. Madhusudan
      Pages 1-13
    2. Can Abstract State Machines Be Useful in Language Theory?

      • Yuri Gurevich, Charles Wallace
      Pages 14-19
    3. Computational Nature of Biochemical Reactions

      • A. Ehrenfeucht, G. Rozenberg
      Pages 36-36
  3. Papers

    1. Weighted Automata and Weighted Logics on Infinite Words

      • Manfred Droste, George Rahonis
      Pages 49-58
    2. Equivalence of Functions Represented by Simple Context-Free Grammars with Output

      • Cédric Bastien, Jurek Czyzowicz, Wojciech Fraczak, Wojciech Rytter
      Pages 71-82
    3. On the Gap-Complexity of Simple RL-Automata

      • F. Mráz, F. Otto, M. Plátek
      Pages 83-94
    4. Noncanonical LALR(1) Parsing

      • Sylvain Schmitz
      Pages 95-107
    5. Context-Free Grammars and XML Languages

      • Alberto Bertoni, Christian Choffrut, Beatrice Palano
      Pages 108-119
    6. Synchronization of Pushdown Automata

      • Didier Caucal
      Pages 120-132
    7. Context-Dependent Nondeterminism for Pushdown Automata

      • Martin Kutrib, Andreas Malcher
      Pages 133-144
    8. Prime Decompositions of Regular Languages

      • Yo-Sub Han, Kai Salomaa, Derick Wood
      Pages 145-155
    9. On Weakly Ambiguous Finite Transducers

      • Nicolae Santean, Sheng Yu
      Pages 156-167
    10. Ciliate Bio-operations on Finite String Multisets

      • Jürgen Dassow, György Vaszil
      Pages 168-179
    11. Characterizing DNA Bond Shapes Using Trajectories

      • Michael Domaratzki
      Pages 180-191
    12. Involution Solid and Join Codes

      • NataÅ¡a Jonoska, Lila Kari, Kalpana Mahalingam
      Pages 192-202
    13. Well-Founded Semantics for Boolean Grammars

      • Vassilis Kountouriotis, Christos Nomikos, Panos Rondogiannis
      Pages 203-214

Other Volumes

  1. Developments in Language Theory

Keywords

  • Automat
  • Variable
  • algorithm
  • algorithms
  • automata
  • complexity
  • complexity theory

Editors and Affiliations

  • Department of Computer Science, University of California, Santa Barbara

    Oscar H. Ibarra

  • School of Electrical Engineering and Computer Science, Washington State University, Pullman, USA

    Zhe Dang

Bibliographic Information

Buying options

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

Tax calculation will be finalised at checkout

Purchases are for personal use only

Learn about institutional subscriptions