Skip to main content
  • Conference proceedings
  • © 2013

Language and Automata Theory and Applications

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

  • Fast track conference proceedings
  • Unique visibility
  • State of the art research

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

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

Conference series link(s): LATA: International Conference on Language and Automata Theory and Applications

Conference proceedings info: LATA 2013.

Buy it now

Buying options

eBook USD 39.99
Price excludes VAT (USA)
  • Available as 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

This is a preview of subscription content, log in via an institution to check for access.

Table of contents (50 papers)

  1. Front Matter

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

Other Volumes

  1. Language and Automata Theory and Applications

About this book

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 verification; 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 artificial 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.

Editors and Affiliations

  • Research Group on Mathematical Linguistics, Universitat Rovira i Virgili, Tarragona, Spain

    Adrian-Horia Dediu, Carlos Martín-Vide

  • Fakultät für Informatik, Institut für Wissens- und Sprachverarbeitung, Otto-von-Guericke-Universität Magdeburg, Magdeburg, Germany

    Bianca Truthe

Bibliographic Information

Buy it now

Buying options

eBook USD 39.99
Price excludes VAT (USA)
  • Available as 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