Skip to main content
SpringerLink
Log in
Book cover

Language and Automata Theory and Applications

10th International Conference, LATA 2016, Prague, Czech Republic, March 14-18, 2016, Proceedings

  • Conference proceedings
  • © 2016

Overview

Editors:
  1. Adrian-Horia Dediu

    1. Rovira i Virgili University, Tarragona, Spain

    View editor publications

    You can also search for this editor in PubMed   Google Scholar

  2. Jan Janoušek

    1. Czech Technical University, Prague, Czech Republic

    View editor publications

    You can also search for this editor in PubMed   Google Scholar

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

  4. Bianca Truthe

    1. Justus Liebig University Giessen, Gießen, 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 9618)

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

Included in the following conference series:

Conference proceedings info: LATA 2016.

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

  1. Combinatorics on Words

    1. Front Matter

      Pages 219-219
      Download chapter PDF

    2. Parallelogram Morphisms and Circular Codes

      • Alexandre Blondin Massé, Mélodie Lapointe, Hugo Tremblay
      Pages 221-232

    3. On Del-Robust Primitive Partial Words with One Hole

      • Ananda Chandra Nayak, Amit K. Srivastava
      Pages 233-244

    4. Optimal Bounds for Computing \(\alpha \)-gapped Repeats

      • Maxime Crochemore, Roman Kolpakov, Gregory Kucherov
      Pages 245-255

  2. Complexity

    1. Front Matter

      Pages 257-257
      Download chapter PDF

    2. On XOR Lemma for Polynomial Threshold Weight and Length

      • Kazuyuki Amano
      Pages 259-269

    3. The Beachcombers’ Problem: Walking and Searching from an Inner Point of a Line

      • Yu Chen, Xiaotie Deng, Ziwei Ji, Chao Liao
      Pages 270-282

    4. Using Duality in Circuit Complexity

      • Silke Czarnetzki, Andreas Krebs
      Pages 283-294

    5. The Minimum Entropy Submodular Set Cover Problem

      • Gabriel Istrate, Cosmin Bonchiş, Liviu P. Dinu
      Pages 295-306

    6. On the Capacity of Capacitated Automata

      • Orna Kupferman, Sarai Sheinvald
      Pages 307-319

    7. On Limited Nondeterminism and ACC Circuit Lower Bounds

      • Holger Spakowski
      Pages 320-329

    8. The Complexity of Induced Tree Reconfiguration Problems

      • Kunihiro Wasa, Katsuhisa Yamanaka, Hiroki Arimura
      Pages 330-342

  3. Grammars

    1. Front Matter

      Pages 343-343
      Download chapter PDF

    2. The Missing Case in Chomsky-Schützenberger Theorem

      • Stefano Crespi Reghizzi, Pierluigi San Pietro
      Pages 345-358

    3. Homomorphic Characterizations of Indexed Languages

      • Séverine Fratani, El Makki Voundy
      Pages 359-370

    4. Ogden’s Lemma, Multiple Context-Free Grammars, and the Control Language Hierarchy

      • Makoto Kanazawa
      Pages 371-383

  4. Grammatical Inference, Algorithmic Learning, and Patterns

    1. Front Matter

      Pages 385-385
      Download chapter PDF

    2. Steganography Based on Pattern Languages

      • Sebastian Berndt, Rüdiger Reischuk
      Pages 387-399

    3. Inferring a Relax NG Schema from XML Documents

      • Guen-Hae Kim, Sang-Ki Ko, Yo-Sub Han
      Pages 400-411

    4. Noise Free Multi-armed Bandit Game

      • Atsuyoshi Nakamura, David P. Helmbold, Manfred K. Warmuth
      Pages 412-423
Back to top

Other volumes

  1. Language and Automata Theory and Applications

Keywords

About this book

This book constitutes the refereed proceedings of the 10th International Conference on Language and Automata Theory and Applications, LATA 2016, held in Prague, Czech Republic, in March 2016.

The 42 revised full papers presented together with 5 invited talks were carefully reviewed and selected from 119 submissions. The papers cover the following topics: algebraic language theory; algorithms for semi-structured data mining, algorithms on automata and words; automata and logic; automata for system analysis and program verification; automata networks, concurrency and Petri nets; automatic structures; cellular automata, codes, combinatorics on words; computational complexity; data and image compression; descriptional complexity; digital libraries and document engineering; foundations of finite state technology; foundations of XML; fuzzy and rough languages; grammatical inference and algorithmic learning; graphs and graph transformation; language varieties and semigroups; parallel and regulated rewriting; parsing; patterns; string and combinatorial issues in computational biology and bioinformatics; string processing algorithms; symbolic dynamics; term rewriting; transducers; trees, tree languages and tree automata; weighted automata.

Editors and Affiliations

  • Rovira i Virgili University, Tarragona, Spain

    Adrian-Horia Dediu, Carlos Martín-Vide

  • Czech Technical University, Prague, Czech Republic

    Jan Janoušek

  • Justus Liebig University Giessen, Gießen, Germany

    Bianca Truthe

Bibliographic Information

Publish with us

Policies and ethics

Back to top

Search

Navigation