Skip to main content
  • Conference proceedings
  • © 2018

Developments in Language Theory

22nd International Conference, DLT 2018, Tokyo, Japan, September 10-14, 2018, Proceedings

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

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 2018.

Buy it now

Buying options

eBook USD 39.99
Price excludes VAT (USA)
  • Available as EPUB and 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, access via your institution.

Table of contents (45 papers)

  1. Front Matter

    Pages I-XIV
  2. Block Sorting-Based Transformations on Words: Beyond the Magic BWT

    • Raffaele Giancarlo, Giovanni Manzini, Antonio Restivo, Giovanna Rosone, Marinella Sciortino
    Pages 1-17
  3. The Runs Theorem and Beyond

    • Tomohiro I
    Pages 18-23
  4. A Brief Excursion to Parity Games

    • Bakhadyr Khoussainov
    Pages 24-35
  5. A Tale of Conjunctive Grammars

    • Alexander Okhotin
    Pages 36-59
  6. Groups, Languages and Dendric Shifts

    • Dominique Perrin
    Pages 60-73
  7. Some Open Problems in Polyomino Tilings

    • Andrew Winslow
    Pages 74-82
  8. Weak Cost Register Automata Are Still Powerful

    • Shaull Almagor, Michaël Cadilhac, Filip Mazowiecki, Guillermo A. Pérez
    Pages 83-95
  9. From Two-Way Transducers to Regular Function Expressions

    • Nicolas Baudru, Pierre-Alain Reynier
    Pages 96-108
  10. Decidability of Right One-Way Jumping Finite Automata

    • Simon Beier, Markus Holzer
    Pages 109-120
  11. Additive Number Theory via Approximation by Regular Languages

    • Jason P. Bell, Thomas F. Lidbetter, Jeffrey Shallit
    Pages 121-132
  12. Tree-to-Graph Transductions with Scope

    • Johanna Björklund
    Pages 133-144
  13. A Characterization of Completely Reachable Automata

    • E. A. Bondar, M. V. Volkov
    Pages 145-155
  14. Inequalities for One-Step Products

    • Mário J. J. Branco, Jean-Éric Pin
    Pages 156-168
  15. On the Commutative Equivalence of Context-Free Languages

    • Arturo Carpi, Flavio D’Alessandro
    Pages 169-181
  16. Simon’s Theorem for Scattered Words

    • Olivier Carton, Maurice Pouzet
    Pages 182-193
  17. The Synchronizing Probability Function for Primitive Sets of Matrices

    • Costanza Catalano, Raphaël M. Jungers
    Pages 194-205
  18. Recognizability for Automata

    • Didier Caucal, Chloé Rispal
    Pages 206-218
  19. Site-Directed Deletion

    • Da-Jung Cho, Yo-Sub Han, Hwee Kim, Kai Salomaa
    Pages 219-230
  20. Counting Subwords and Regular Languages

    • Charles J. Colbourn, Ryan E. Dougherty, Thomas F. Lidbetter, Jeffrey Shallit
    Pages 231-242

Other Volumes

  1. Developments in Language Theory

About this book

This book constitutes the proceedings of the 22nd International Conference on Developments in Language Theory, DLT 2018, held in Tokyo, Japan, in September 2018. The 39 full papers presented  in this volume were carefully reviewed and selected from 84 submissions. The papers cover the following topics and areas: combinatorial and algebraic properties  of words and languages; grammars, acceptors and transducers for strings, trees, graphics, arrays; algebraic theories for automata and languages; codes; efficient text algorithms; symbolic dynamics; decision problems; relationships to complexity theory and logic; picture description and analysis, polyominoes and bidimensional patterns; cryptography; concurrency; celluar automata; bio-inspired computing; quantum computing.

Keywords

  • algebraic language theory
  • automata theory
  • combinatorics
  • computational linguistics
  • context free languages
  • finite automata
  • formal languages
  • formal logic
  • free languages
  • graph theory
  • rewrite systems
  • semantics
  • translation (languages)
  • Turing machines
  • algorithm analysis and problem complexity

Editors and Affiliations

  • National Archives of Japan, Tokyo, Japan

    Mizuho Hoshi

  • The University of Electro-Communications, Tokyo, Japan

    Shinnosuke Seki

Bibliographic Information

Buy it now

Buying options

eBook USD 39.99
Price excludes VAT (USA)
  • Available as EPUB and 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