Skip to main content
SpringerLink
Log in

Developments in Language Theory

23rd International Conference, DLT 2019, Warsaw, Poland, August 5–9, 2019, Proceedings

  • Conference proceedings
  • © 2019

Overview

Editors:
  1. Piotrek Hofman

    1. University of Warsaw, Warsaw, Poland

    View editor publications

    You can also search for this editor in PubMed   Google Scholar

  2. Michał Skrzypczak

    1. University of Warsaw, Warsaw, Poland

    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 11647)

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

Included in the following conference series:

Conference proceedings info: DLT 2019.

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

Licence this eBook for your library

Institutional subscriptions

Table of contents (23 papers)

  1. Front Matter

    Pages i-x
    Download chapter PDF

  2. Invited Papers

    1. Front Matter

      Pages 1-1
      Download chapter PDF

    2. Inherent Size Blowup in \(\omega \)-Automata

      • Udi Boker
      Pages 3-17

    3. Deciding Context Unification (with Regular Constraints)

      • Artur Jeż
      Pages 18-40

    4. Single-Stranded Architectures for Computing

      • Shinnosuke Seki
      Pages 41-56

  3. Regular Papers

    1. Front Matter

      Pages 57-57
      Download chapter PDF

    2. A Linear Bound on the K-Rendezvous Time for Primitive Sets of NZ Matrices

      • Umer Azfar, Costanza Catalano, Ludovic Charlier, Raphaël M. Jungers
      Pages 59-73

    3. Words of Minimum Rank in Deterministic Finite Automata

      • Jarkko Kari, Andrew Ryzhikov, Anton Varonka
      Pages 74-87

    4. On the Length of Shortest Strings Accepted by Two-Way Finite Automata

      • Egor Dobronravov, Nikita Dobronravov, Alexander Okhotin
      Pages 88-99

    5. Characterizing the Valuedness of Two-Way Finite Transducers

      • Di-De Yen, Hsu-Chun Yen
      Pages 100-112

    6. Input-Driven Pushdown Automata for Edit Distance Neighborhood

      • Viliam Geffert, Zuzana Bednárová, Alexander Szabari
      Pages 113-126

    7. The Relative Edit-Distance Between Two Input-Driven Languages

      • Hyunjoon Cheon, Yo-Sub Han, Sang-Ki Ko, Kai Salomaa
      Pages 127-139

    8. On Shrinking Restarting Automata of Window Size One and Two

      • František Mráz, Friedrich Otto
      Pages 140-153

    9. The Teaching Complexity of Erasing Pattern Languages with Bounded Variable Frequency

      • Ziyuan Gao
      Pages 154-167

    10. On Timed Scope-Bounded Context-Sensitive Languages

      • D. Bhave, S. N. Krishna, R. Phawade, A. Trivedi
      Pages 168-181

    11. Logics for Reversible Regular Languages and Semigroups with Involution

      • Paul Gastin, Amaldev Manuel, R. Govind
      Pages 182-191

    12. Eventually Safe Languages

      • Simon Iosti, Denis Kuperberg
      Pages 192-205

    13. Coinductive Algorithms for Büchi Automata

      • Denis Kuperberg, Laureline Pinault, Damien Pous
      Pages 206-220

    14. Hole-Free Partially Directed Animals

      • Paolo Massazza
      Pages 221-233

    15. First Lower Bounds for Palindromic Length

      • Anna E. Frid
      Pages 234-243
Back to top

Other volumes

  1. Developments in Language Theory

Keywords

About this book

This book constitutes the proceedings of the 23rd International Conference on Developments in Language Theory, DLT 2019, held in Warsaw, Poland, in August 2019. 

The 20 full papers presented together with three invited talks were carefully reviewed and selected from 30 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.





Editors and Affiliations

  • University of Warsaw, Warsaw, Poland

    Piotrek Hofman, Michał Skrzypczak

Bibliographic Information

Publish with us

Policies and ethics

Back to top

Search

Navigation