Skip to main content
SpringerLink
Log in
Book cover

Language and Automata Theory and Applications

5th International Conference, LATA 2011, Tarragona, Spain, May 26-31, 2011

  • Conference proceedings
  • © 2011

Overview

Editors:
  1. Adrian-Horia Dediu

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

    View editor publications

    You can also search for this editor in PubMed   Google Scholar

  2. Shunsuke Inenaga

    1. Department of Informatics, Kyushu University, Fukuoka, Japan

    View editor publications

    You can also search for this editor in PubMed   Google Scholar

  3. Carlos Martín-Vide

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

    View editor publications

    You can also search for this editor in PubMed   Google Scholar

  • Up to date results
  • Fast conference proceedings
  • State-of-the-art report

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

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

Included in the following conference series:

Conference proceedings info: LATA 2011.

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

Access this book

Log in via an institution
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

Licence this eBook for your library

Institutional subscriptions

Table of contents (40 papers)

  1. Front Matter

    Download chapter PDF

  2. Invited Talks

    1. Green’s Relations and Their Use in Automata Theory

      • Thomas Colcombet
      Pages 1-21

    2. Automatic Structures and Groups

      • Bakhadyr Khoussainov
      Pages 22-40

    3. Vector Addition System Reachability Problem: A Short Self-contained Proof

      • Jérôme Leroux
      Pages 41-64

    4. Abstract Numeration Systems

      • Narad Rampersad
      Pages 65-79

  3. Regular Papers

    1. Rule Formats for Distributivity

      • Luca Aceto, Matteo Cimini, Anna Ingolfsdottir, Mohammad Reza Mousavi, Michel A. Reniers
      Pages 80-91

    2. Mutation Systems

      • Dana Angluin, James Aspnes, Raonne Barbosa Vargas
      Pages 92-104

    3. Classification of String Languages via Tiling Recognizable Picture Languages

      • Marcella Anselmo, Dora Giammarresi, Maria Madonia
      Pages 105-116

    4. A Simple and Efficient Universal Reversible Turing Machine

      • Holger Bock Axelsen, Robert Glück
      Pages 117-128

    5. The Parameterized Complexity of Chosen Problems for Finite Automata on Trees

      • Agata Barecka, Witold Charatonik
      Pages 129-141

    6. Recognizing Shuffled Languages

      • Martin Berglund, Henrik Björklund, Johanna Högberg
      Pages 142-154

    7. Unary Pattern Avoidance in Partial Words Dense with Holes

      • Francine Blanchet-Sadri, Kevin Black, Andrew Zemke
      Pages 155-166

    8. Characterizing Compressibility of Disjoint Subgraphs with NLC Grammars

      • Robert Brijder, Hendrik Blockeel
      Pages 167-178

    9. Partial Derivatives of an Extended Regular Expression

      • Pascal Caron, Jean-Marc Champarnaud, Ludovic Mignot
      Pages 179-191

    10. Automatic Learning of Subclasses of Pattern Languages

      • John Case, Sanjay Jain, Trong Dao Le, Yuh Shin Ong, Pavel Semukhin, Frank Stephan
      Pages 192-203

    11. Finite Orbits of Language Operations

      • Émilie Charlier, Mike Domaratzki, Tero Harju, Jeffrey Shallit
      Pages 204-215

    12. Finitary Languages

      • Krishnendu Chatterjee, Nathanaël Fijalkow
      Pages 216-226

    13. The Complexity of Request-Response Games

      • Krishnendu Chatterjee, Thomas A. Henzinger, Florian Horn
      Pages 227-237

    14. Improved Alignment Based Algorithm for Multilingual Text Compression

      • Ehud S. Conley, Shmuel Tomi Klein
      Pages 238-249

    15. Singular Artin Monoids of Finite Coxeter Type Are Automatic

      • Ruth Corran, Michael Hoffmann, Dietrich Kuske, Richard M. Thomas
      Pages 250-261
Back to top

Other volumes

  1. Language and Automata Theory and Applications

Keywords

About this book

This book constitutes the refereed proceedings of the 5th International Conference on Language and Automata Theory and Applications, LATA 2011, held in Tarragona, Spain in May 2011. The 36 revised full papers presented together with four invited articles were carefully selected from 91 submissions. Among the topics covered are algebraic language theory, automata and logic, systems analysis, systems verifications, computational complexity, decidability, unification, graph transformations, language-based cryptography, and applications in data mining, computational learning, and pattern recognition.

Editors and Affiliations

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

    Adrian-Horia Dediu, Carlos Martín-Vide

  • Department of Informatics, Kyushu University, Fukuoka, Japan

    Shunsuke Inenaga

Bibliographic Information

Publish with us

Policies and ethics

Back to top

Search

Navigation