Skip to main content
Springer Nature Link
Log in

Developments in Language Theory

16th International Conference, DLT 2012, Taipei, Taiwan, August 14-17, 2012, Proceedings

  • Conference proceedings
  • © 2012

Overview

Editors:
  1. Hsu-Chun Yen

    1. Deptartment of Electrical Engineering, National Taiwan University, Taipei, Taiwan

    View editor publications

    You can also search for this editor in PubMed   Google Scholar

  2. Oscar H. Ibarra

    1. Department of Computer Science, University of California, Santa Barbara, USA

    View editor publications

    You can also search for this editor in PubMed   Google Scholar

  • Fast track conference proceedings
  • Unique visibility
  • State of the art research

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

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

Included in the following conference series:

Conference proceedings info: DLT 2012.

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

Access this book

Log in via an institution

Subscribe and save

Springer+ Basic
$34.99 /Month
  • Get 10 units per month
  • Download Article/Chapter or eBook
  • 1 Unit = 1 Article or 1 Chapter
  • Cancel anytime
Subscribe now

Buy Now

eBook USD 39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever

Tax calculation will be finalised at checkout

Other ways to access

Licence this eBook for your library

Institutional subscriptions

About this book

This book constitutes the refereed proceedings of the 16th International Conference on Developments in Language Theory, DLT 2012, held in Taipei, Taiwan, in August 2012.
The 34 regular papers presented were carefully reviewed and selected from numerous submissions. The volume also contains the papers or extended abstracts of 4 invited lectures, as well as a special memorial presentation in honor of Sheng Yu. The topics covered include 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; quantum computing.

Similar content being viewed by others

Keywords

Table of contents (43 papers)

  1. Front Matter

    Download chapter PDF

  2. Invited Talks

    1. The Kind Hearted Dragon Prof. Sheng Yu, 1950-2012

      • Andrew L. Szilard
      Pages 1-6

    2. P and dP Automata: Unconventional versus Classical Automata

      • Erzsébet Csuhaj-Varjú
      Pages 7-22

    3. Recovering Strings in Oracles: Quantum and Classic

      • Kazuo Iwama
      Pages 23-23

    4. Determinism vs. Nondeterminism for Two-Way Automata

      • Juraj Hromkovič, Rastislav Královič, Richard Královič, Richard Štefanec
      Pages 24-39

    5. Cellular Automata, the Collatz Conjecture and Powers of 3/2

      • Jarkko Kari
      Pages 40-49

  3. Regular Papers

    1. Quotient Complexities of Atoms of Regular Languages

      • Janusz Brzozowski, Hellis Tamm
      Pages 50-61

    2. Decidability of Geometricity of Regular Languages

      • Marie-Pierre Béal, Jean-Marc Champarnaud, Jean-Philippe Dubernard, Hadrien Jeanne, Sylvain Lombardy
      Pages 62-72

    3. Inside the Class of REGEX Languages

      • Markus L. Schmid
      Pages 73-84

    4. Computing the Edit-Distance between a Regular Language and a Context-Free Language

      • Yo-Sub Han, Sang-Ki Ko, Kai Salomaa
      Pages 85-96

    5. Semigroups with a Context-Free Word Problem

      • Michael Hoffmann, Derek F. Holt, Matthew D. Owens, Richard M. Thomas
      Pages 97-108

    6. Generalized Derivations with Synchronized Context-Free Grammars

      • Markus Holzer, Sebastian Jakobi, Ian McQuillan
      Pages 109-120

    7. Non-erasing Variants of the Chomsky–Schützenberger Theorem

      • Alexander Okhotin
      Pages 121-129

    8. Regular and Context-Free Pattern Languages over Small Alphabets

      • Daniel Reidenbach, Markus L. Schmid
      Pages 130-141

    9. On Context-Free Languages of Scattered Words

      • Zoltan Ésik, Satoshi Okawa
      Pages 142-153

    10. Homomorphisms Preserving Deterministic Context-Free Languages

      • Tommi Lehtinen, Alexander Okhotin
      Pages 154-165

    11. Unary Coded NP-Complete Languages in ASPACE (log log n)

      • Viliam Geffert, Dana Pardubská
      Pages 166-177

    12. Dense Completeness

      • Andreas Krebs, Klaus-Jörn Lange
      Pages 178-189

    13. From Equivalence to Almost-Equivalence, and Beyond—Minimizing Automata with Errors

      • Markus Holzer, Sebastian Jakobi
      Pages 190-201

    14. Analogs of Fagin’s Theorem for Small Nondeterministic Finite Automata

      • Christos A. Kapoutsis, Nans Lefebvre
      Pages 202-213
Back to top

Other volumes

  1. Developments in Language Theory

Editors and Affiliations

  • Deptartment of Electrical Engineering, National Taiwan University, Taipei, Taiwan

    Hsu-Chun Yen

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

    Oscar H. Ibarra

Bibliographic Information

Publish with us

Policies and ethics

Back to top