Book Volume 8977 2015

Language and Automata Theory and Applications

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

ISBN: 978-3-319-15578-4 (Print) 978-3-319-15579-1 (Online)

Table of contents (58 chapters)

previous Page of 3
  1. Front Matter

    Pages I-XV

  2. Invited Talks

    1. Front Matter

      Pages 1-1

    2. No Access

      Chapter

      Pages 3-24

      Automated Synthesis of Application-Layer Connectors from Automata-Based Specifications

    3. No Access

      Chapter

      Pages 25-46

      Automated Program Verification

    4. No Access

      Chapter

      Pages 47-55

      Hankel Matrices: From Words to Graphs (Extended Abstract)

    5. No Access

      Chapter

      Pages 56-69

      Complexity Classes for Membrane Systems: A Survey

    6. No Access

      Chapter

      Pages 70-81

      The Shuffle Product: New Research Directions

  3. Algorithms

    1. Front Matter

      Pages 83-83

    2. No Access

      Chapter

      Pages 85-96

      Average-Case Optimal Approximate Circular String Matching

    3. No Access

      Chapter

      Pages 97-108

      An Efficient Best-Trees Algorithm for Weighted Tree Automata over the Tropical Semiring

    4. No Access

      Chapter

      Pages 109-120

      Construction of a de Bruijn Graph for Assembly from a Truncated Suffix Tree

    5. No Access

      Chapter

      Pages 121-132

      Frequent Pattern Mining with Non-overlapping Inversions

    6. No Access

      Chapter

      Pages 133-144

      A Parallel Algorithm for Finding All Minimal Maximum Subsequences via Random Walk

    7. No Access

      Chapter

      Pages 145-160

      Building Bridges Between Sets of Partial Orders

    8. No Access

      Chapter

      Pages 161-172

      Complexity of Road Coloring with Prescribed Reset Words

  4. Automata, Logic, and Concurrency

    1. Front Matter

      Pages 173-173

    2. No Access

      Chapter

      Pages 175-187

      Logics for Unordered Trees with Data Constraints on Siblings

    3. No Access

      Chapter

      Pages 188-199

      Weak and Nested Class Memory Automata

    4. No Access

      Chapter

      Pages 200-211

      Insertion Operations on Deterministic Reversal-Bounded Counter Machines

    5. No Access

      Chapter

      Pages 212-223

      On the Synchronizing Probability Function and the Triple Rendezvous Time

    6. No Access

      Chapter

      Pages 224-236

      On Robot Games of Degree Two

    7. No Access

      Chapter

      Pages 237-248

      Time-Bounded Reachability Problem for Recursive Timed Automata is Undecidable

    8. No Access

      Chapter

      Pages 249-262

      On Observability of Automata Networks via Computational Algebra

    9. No Access

      Chapter

      Pages 263-274

      Reasoning on Schemas of Formulas: An Automata-Based Approach

previous Page of 3