Language and Automata Theory and Applications

9th International Conference, LATA 2015, Nice, France, March 2-6, 2015, Proceedings

  • Adrian-Horia Dediu
  • Enrico Formenti
  • Carlos Martín-Vide
  • Bianca Truthe
Conference proceedings LATA 2015

DOI: 10.1007/978-3-319-15579-1

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

Table of contents (58 papers)

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

    1. Front Matter
      Pages 1-1
    2. Automated Synthesis of Application-Layer Connectors from Automata-Based Specifications
      Marco Autili, Paola Inverardi, Filippo Mignosi, Romina Spalazzese, Massimo Tivoli
      Pages 3-24
    3. Automated Program Verification
      Azadeh Farzan, Matthias Heizmann, Jochen Hoenicke, Zachary Kincaid, Andreas Podelski
      Pages 25-46
    4. Hankel Matrices: From Words to Graphs (Extended Abstract)
      Johann A. Makowsky, Nadia Labai
      Pages 47-55
    5. Complexity Classes for Membrane Systems: A Survey
      Giancarlo Mauri, Alberto Leporati, Luca Manzoni, Antonio E. Porreca, Claudio Zandron
      Pages 56-69
    6. The Shuffle Product: New Research Directions
      Antonio Restivo
      Pages 70-81
  3. Algorithms

    1. Front Matter
      Pages 83-83
    2. Average-Case Optimal Approximate Circular String Matching
      Carl Barton, Costas S. Iliopoulos, Solon P. Pissis
      Pages 85-96
    3. An Efficient Best-Trees Algorithm for Weighted Tree Automata over the Tropical Semiring
      Johanna Björklund, Frank Drewes, Niklas Zechner
      Pages 97-108
    4. Construction of a de Bruijn Graph for Assembly from a Truncated Suffix Tree
      Bastien Cazaux, Thierry Lecroq, Eric Rivals
      Pages 109-120
    5. Frequent Pattern Mining with Non-overlapping Inversions
      Da-Jung Cho, Yo-Sub Han, Hwee Kim
      Pages 121-132
    6. Building Bridges Between Sets of Partial Orders
      Hernán Ponce-de-León, Andrey Mokhov
      Pages 145-160
    7. Complexity of Road Coloring with Prescribed Reset Words
      Vojtěch Vorel, Adam Roman
      Pages 161-172
  4. Automata, Logic, and Concurrency

    1. Front Matter
      Pages 173-173
    2. Logics for Unordered Trees with Data Constraints on Siblings
      Adrien Boiret, Vincent Hugot, Joachim Niehren, Ralf Treinen
      Pages 175-187
    3. Weak and Nested Class Memory Automata
      Conrad Cotton-Barratt, Andrzej S. Murawski, C.-H. Luke Ong
      Pages 188-199
    4. Insertion Operations on Deterministic Reversal-Bounded Counter Machines
      Joey Eremondi, Oscar H. Ibarra, Ian McQuillan
      Pages 200-211
    5. On the Synchronizing Probability Function and the Triple Rendezvous Time
      François Gonze, Raphaël M. Jungers
      Pages 212-223

About these proceedings


This book constitutes the refereed proceedings of the 9th International Conference on Language and Automata Theory and Applications, LATA 2015, held in Nice, France in March 2015. The 53 revised full papers presented together with 5 invited talks were carefully reviewed and selected from 115 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.


Algorithmic Learning Automata and Concurrency Automated Reasoning Backward Pattern Matching Combinatorics on Words Computational Complexity Data and Image Compression Decidability Distributional Learning Dynamical Systems Finite Automata Language Approximation Logic Programming Parameterized Complexity Recursive State Machines Regular Tree Automata SAT Solving Temporal Logic Term Rewriting Transducers

Editors and affiliations

  • Adrian-Horia Dediu
    • 1
  • Enrico Formenti
    • 2
  • Carlos Martín-Vide
    • 3
  • Bianca Truthe
    • 4
  1. 1.Rovira i Virgili UniversityTarragonaSpain
  2. 2.Nice Sophia Antipolis UniversitySophia AntipolisFrance
  3. 3.Mathematical LinguisticsRovira i Virgili UniversityTarragonaSpain
  4. 4.Justus-Liebig-UniversitätGießenGermany

Bibliographic information

  • Copyright Information Springer International Publishing Switzerland 2015
  • Publisher Name Springer, Cham
  • eBook Packages Computer Science
  • Print ISBN 978-3-319-15578-4
  • Online ISBN 978-3-319-15579-1
  • Series Print ISSN 0302-9743
  • Series Online ISSN 1611-3349