Language and Automata Theory and Applications

7th International Conference, LATA 2013, Bilbao, Spain, April 2-5, 2013. Proceedings

Editors:

ISBN: 978-3-642-37063-2 (Print) 978-3-642-37064-9 (Online)

Table of contents (50 chapters)

previous Page of 3
  1. Front Matter

    Pages -

  2. Invited Talks

    1. No Access

      Book Chapter

      Pages 1-11

      Complexity Dichotomy for Counting Problems

    2. No Access

      Book Chapter

      Pages 12-12

      Algorithms for Analyzing and Verifying Infinite-State Recursive Probabilistic Systems

    3. No Access

      Book Chapter

      Pages 13-41

      Recursion Schemes, Collapsible Pushdown Automata and Higher-Order Model Checking

    4. No Access

      Book Chapter

      Pages 42-42

      Discrete Linear Dynamical Systems

    5. No Access

      Book Chapter

      Pages 43-43

      XML Schema Management: A Challenge for Automata Theory

  3. Regular Papers

    1. No Access

      Book Chapter

      Pages 44-55

      On the Complexity of Shortest Path Problems on Discounted Cost Graphs

    2. No Access

      Book Chapter

      Pages 56-67

      Termination of Rule-Based Calculi for Uniform Semi-Unification

    3. No Access

      Book Chapter

      Pages 68-79

      Deciding WQO for Factorial Languages

    4. No Access

      Book Chapter

      Pages 80-91

      On the Construction of a Family of Automata That Are Generically Non-minimal

    5. No Access

      Book Chapter

      Pages 92-103

      Limited Non-determinism Hierarchy of Counter Automata

    6. No Access

      Book Chapter

      Pages 104-115

      Unambiguous Automata Denoting Finitely Sequential Functions

    7. No Access

      Book Chapter

      Pages 116-127

      Duplication-Loss Genome Alignment: Complexity and Algorithm

    8. No Access

      Book Chapter

      Pages 128-140

      Maximizing Entropy over Markov Processes

    9. No Access

      Book Chapter

      Pages 141-152

      MAT Learning of Universal Automata

    10. No Access

      Book Chapter

      Pages 153-164

      A Graph Polynomial Approach to Primitivity

    11. No Access

      Book Chapter

      Pages 165-176

      Suffix Trees for Partial Words and the Longest Common Compatible Prefix Problem

    12. No Access

      Book Chapter

      Pages 177-189

      Dynamic Communicating Automata and Branching High-Level MSCs

    13. No Access

      Book Chapter

      Pages 190-201

      Visibly Pushdown Automata: Universality and Inclusion via Antichains

    14. No Access

      Book Chapter

      Pages 202-213

      Two-Sided Derivatives for Regular Expressions and for Hairpin Expressions

    15. No Access

      Book Chapter

      Pages 214-225

      How to Travel between Languages

previous Page of 3