Language and Automata Theory and Applications

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

  • Adrian-Horia Dediu
  • Carlos Martín-Vide
  • Bianca Truthe
Conference proceedings LATA 2013

DOI: 10.1007/978-3-642-37064-9

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

Table of contents (50 papers)

  1. Front Matter
  2. Invited Talks

  3. Regular Papers

    1. On the Complexity of Shortest Path Problems on Discounted Cost Graphs
      Rajeev Alur, Sampath Kannan, Kevin Tian, Yifei Yuan
      Pages 44-55
    2. Termination of Rule-Based Calculi for Uniform Semi-Unification
      Takahito Aoto, Munehiro Iwami
      Pages 56-67
    3. Deciding WQO for Factorial Languages
      Aistis Atminas, Vadim Lozin, Mikhail Moshkov
      Pages 68-79
    4. On the Construction of a Family of Automata That Are Generically Non-minimal
      Parisa Babaali, Christopher Knaplund
      Pages 80-91
    5. Limited Non-determinism Hierarchy of Counter Automata
      Sebastian Bala, Dariusz Jackowski
      Pages 92-103
    6. Unambiguous Automata Denoting Finitely Sequential Functions
      Sebastian Bala, Artur Koniński
      Pages 104-115
    7. Duplication-Loss Genome Alignment: Complexity and Algorithm
      Billel Benzaid, Riccardo Dondi, Nadia El-Mabrouk
      Pages 116-127
    8. Maximizing Entropy over Markov Processes
      Fabrizio Biondi, Axel Legay, Bo Friis Nielsen, Andrzej Wąsowski
      Pages 128-140
    9. MAT Learning of Universal Automata
      Johanna Björklund, Henning Fernau, Anna Kasprzik
      Pages 141-152
    10. A Graph Polynomial Approach to Primitivity
      Francine Blanchet-Sadri, Michelle Bodnar, Nathan Fox, Joe Hidakatsu
      Pages 153-164
    11. Suffix Trees for Partial Words and the Longest Common Compatible Prefix Problem
      Francine Blanchet-Sadri, Justin Lazarow
      Pages 165-176
    12. Dynamic Communicating Automata and Branching High-Level MSCs
      Benedikt Bollig, Aiswarya Cyriac, Loïc Hélouët, Ahmet Kara, Thomas Schwentick
      Pages 177-189
    13. Visibly Pushdown Automata: Universality and Inclusion via Antichains
      Véronique Bruyère, Marc Ducobu, Olivier Gauwin
      Pages 190-201
    14. Two-Sided Derivatives for Regular Expressions and for Hairpin Expressions
      Jean-Marc Champarnaud, Jean-Philippe Dubernard, Hadrien Jeanne, Ludovic Mignot
      Pages 202-213

About these proceedings

Introduction

This book constitutes the refereed proceedings of the 7th International Conference on Language and Automata Theory and Applications, LATA 2013, held in Bilbao, Spain in April 2013.
The 45 revised full papers presented together with 5 invited talks were carefully reviewed and selected from 97 initial submissions. The volume features contributions from both classical theory fields and application areas (bioinformatics, systems biology, language technology, artificial intelligence, etc.). Among the topics covered are algebraic language theory; algorithms for semi-structured data mining; algorithms on automata and words; automata and logic; automata for system analysis and program verifiation; automata, concurrency and Petri nets; automatic structures; cellular automata; combinatorics on words; computability; computational complexity; computational linguistics; data and image compression; decidability questions on words and languages; descriptional complexity; DNA and other models of bio-inspired computing; document engineering; foundations of finite state technology; foundations of XML; fuzzy and rough languages; grammars (Chomsky hierarchy, contextual, multidimensional, unification, categorial, etc.); grammars and automata architectures; grammatical inference and algorithmic learning; graphs and graph transformation; language varieties and semigroups; language-based cryptography; language-theoretic foundations of artificial intelligence and artifi- cial life; parallel and regulated rewriting; parsing; pattern recognition; patterns and codes; power series; quantum, chemical and optical computing; semantics; string and combinatorial issues in computational biology and bioinformatics; string processing algorithms; symbolic dynamics; symbolic neural networks; term rewriting; transducers; trees, tree languages and tree automata; weighted automata.

Keywords

dynamic programming formal languages model checking process calculus static typechecking

Editors and affiliations

  • Adrian-Horia Dediu
    • 1
  • Carlos Martín-Vide
    • 1
  • Bianca Truthe
    • 2
  1. 1.Research Group on Mathematical LinguisticsUniversitat Rovira i VirgiliTarragonaSpain
  2. 2.Fakultät für Informatik, Institut für Wissens- und SprachverarbeitungOtto-von-Guericke-Universität MagdeburgMagdeburgGermany

Bibliographic information

  • Copyright Information Springer-Verlag Berlin Heidelberg 2013
  • Publisher Name Springer, Berlin, Heidelberg
  • eBook Packages Computer Science
  • Print ISBN 978-3-642-37063-2
  • Online ISBN 978-3-642-37064-9
  • Series Print ISSN 0302-9743
  • Series Online ISSN 1611-3349