Skip to main content
SpringerLink
Log in
Book cover

Language and Automata Theory and Applications

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

  • Conference proceedings
  • © 2017

Overview

Editors:
  1. Frank Drewes

    1. Umeå University, Umeå, Sweden

    View editor publications

    You can also search for this editor in PubMed   Google Scholar

  2. Carlos Martín-Vide

    1. Rovira i Virgili University, Tarragona, Spain

    View editor publications

    You can also search for this editor in PubMed   Google Scholar

  3. Bianca Truthe

    1. University of Giessen, Giessen, Germany

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

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

Included in the following conference series:

Conference proceedings info: LATA 2017.

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 (33 papers)

  1. Front Matter

    Pages I-XXIII
    Download chapter PDF

  2. Invited Talks

    1. Front Matter

      Pages 1-1
      Download chapter PDF

    2. Approximation in Description Logics: How Weighted Tree Automata Can Help to Define the Required Concept Comparison Measures in \(\mathcal {FL}_0\)

      • Franz Baader, Oliver Fernández Gil, Pavlos Marantidis
      Pages 3-26

    3. Logic, Languages, and Rules for Web Data Extraction and Reasoning over Data

      • Georg Gottlob, Christoph Koch, Andreas Pieris
      Pages 27-47

  3. Algorithmic Learning and Semantics

    1. Front Matter

      Pages 49-49
      Download chapter PDF

    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. The Strong, Weak, and Very Weak Finite Context and Kernel Properties

      • Makoto Kanazawa, Ryo Yoshinaka
      Pages 77-88

  4. Automata and Logics

    1. Front Matter

      Pages 89-89
      Download chapter PDF

    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
      Download chapter PDF

    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
      Download chapter PDF

    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
Back to top

Other volumes

  1. Language and Automata Theory and Applications

Keywords

About this book

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.

Editors and Affiliations

  • Umeå University, Umeå, Sweden

    Frank Drewes

  • Rovira i Virgili University, Tarragona, Spain

    Carlos Martín-Vide

  • University of Giessen, Giessen, Germany

    Bianca Truthe

Bibliographic Information

Publish with us

Policies and ethics

Back to top

Search

Navigation