Language and Automata Theory and Applications

11th International Conference, LATA 2017, Umeå, Sweden, March 6-9, 2017, Proceedings

  • Drewes Frank 
  • Martín-Vide Carlos 
  • Truthe Bianca 
Conference proceedings LATA 2017

DOI: 10.1007/978-3-319-53733-7

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

Table of contents (33 papers)

  1. Front Matter
    Pages I-XXIII
  2. Invited Talks

  3. Algorithmic Learning and Semantics

    1. Front Matter
      Pages 49-49
    2. A Stable Non-interleaving Early Operational Semantics for the Pi-Calculus
      Thomas Troels Hildebrandt, Christian Johansen, Håkon Normann
      Pages 51-63
    3. Efficient Learning of Tier-Based Strictly k-Local Languages
      Adam Jardine, Kevin McMullin
      Pages 64-76
  4. Automata and Logics

    1. Front Matter
      Pages 89-89
    2. \(\mathbb {N}\)-Memory Automata over the Alphabet \(\mathbb {N}\)
      Benedikt Brütsch, Patrick Landwehr, Wolfgang Thomas
      Pages 91-102
    3. An Automata View to Goal-Directed Methods
      Lisa Hutschenreiter, Rafael Peñaloza
      Pages 103-114
    4. A Calculus of Cyber-Physical Systems
      Ruggero Lanotte, Massimo Merro
      Pages 115-127
  5. Combinatorics on Words, Compression, and Pattern Matching

    1. Front Matter
      Pages 129-129
    2. Efficient Pattern Matching in Elastic-Degenerate Texts
      Costas S. Iliopoulos, Ritu Kundu, Solon P. Pissis
      Pages 131-142
    3. Integrated Encryption in Dynamic Arithmetic Compression
      Shmuel T. Klein, Dana Shapira
      Pages 143-154
    4. Two-Dimensional Palindromes and Their Properties
      Manasi S. Kulkarni, Kalpana Mahalingam
      Pages 155-167
  6. Complexity

    1. Front Matter
      Pages 169-169
    2. Complexity of Left-Ideal, Suffix-Closed and Suffix-Free Regular Languages
      Janusz A. Brzozowski, Corwin Sinnamon
      Pages 171-182
    3. On the Complexity of Hard Enumeration Problems
      Nadia Creignou, Markus Kröll, Reinhard Pichler, Sebastian Skritek, Heribert Vollmer
      Pages 183-195
    4. Consensus String Problem for Multiple Regular Languages
      Yo-Sub Han, Sang-Ki Ko, Timothy Ng, Kai Salomaa
      Pages 196-207

About these proceedings

Introduction

This book constitutes the refereed proceedings of the 11th International Conference on Language and Automata Theory and Applications, LATA 2017, held in Umeå, Sweden, in March 2017.

The 31 revised full papers presented together with 4 invited talks were carefully reviewed and selected from 73 submissions. The papers cover the following topics: algorithmic learning and semantics; automata and logics; combinatorics on words, compression, and pattern matching; complexity; finite automata; grammars, languages, and parsing; graphs and Petri Nets; non-classical automata; and pushdown automata and systems.

Keywords

algorithmic learning cellular automata computational complexity cyber-physical system semantics automata computer science logic concurrency context-free languages finite automata formal languages and automata theory grammars indexed languages languages parametrized complexity petri nets regular expressions theory of computation transducers weighted automata

Editors and affiliations

  • Drewes Frank 
    • 1
  • Martín-Vide Carlos 
    • 2
  • Truthe Bianca 
    • 3
  1. 1.Umeå UniversityUmeåSweden
  2. 2.Rovira i Virgili UniversityTarragonaSpain
  3. 3.University of GiessenGiessenGermany

Bibliographic information

  • Copyright Information Springer International Publishing AG 2017
  • Publisher Name Springer, Cham
  • eBook Packages Computer Science
  • Print ISBN 978-3-319-53732-0
  • Online ISBN 978-3-319-53733-7
  • Series Print ISSN 0302-9743
  • Series Online ISSN 1611-3349