Skip to main content
SpringerLink
Log in
Book cover

Language and Automata Theory and Applications

6th International Conference, LATA 2012, A Coruña, Spain, March 5-9, 2012, Proceedings

  • Conference proceedings
  • © 2012

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

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

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

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

Included in the following conference series:

Conference proceedings info: LATA 2012.

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 (46 papers)

  1. Front Matter

    Download chapter PDF

  3. Regular Papers

    1. The Minimal Cost Reachability Problem in Priced Timed Pushdown Systems

      • Parosh Aziz Abdulla, Mohamed Faouzi Atig, Jari Stenman
      Pages 58-69

    2. Unification Modulo Chaining

      • Siva Anantharaman, Christopher Bouchard, Paliath Narendran, Michael Rusinowitch
      Pages 70-82

    3. Isomorphism Testing of Boolean Functions Computable by Constant-Depth Circuits

      • Vikraman Arvind, Yadu Vasudev
      Pages 83-94

    4. Reversible Multi-head Finite Automata Characterize Reversible Logarithmic Space

      • Holger Bock Axelsen
      Pages 95-105

    5. Defining Contexts in Context-Free Grammars

      • Mikhail Barash, Alexander Okhotin
      Pages 106-118

    6. Longest Common Extensions via Fingerprinting

      • Philip Bille, Inge Li Gørtz, Jesper Kristensen
      Pages 119-130

    7. Fast and Cache-Oblivious Dynamic Programming with Local Dependencies

      • Philip Bille, Morten Stöckel
      Pages 131-142

    8. An Efficient Implicit OBDD-Based Algorithm for Maximal Matchings

      • Beate Bollig, Tobias Pröger
      Pages 143-154

    9. Strong Termination for Gap-Order Constraint Abstractions of Counter Systems

      • Laura Bozzelli
      Pages 155-168

    10. Covering Space in the Besicovitch Topology

      • Julien Cervelle
      Pages 169-178

    11. Approximate Regular Expressions and Their Derivatives

      • Jean-Marc Champarnaud, Hadrien Jeanne, Ludovic Mignot
      Pages 179-191

    12. Catalytic Petri Nets Are Turing Complete

      • Gabriel Ciobanu, G. Michele Pinna
      Pages 192-203

    13. Computational Complexity of Rule Distributions of Non-uniform Cellular Automata

      • Alberto Dennunzio, Enrico Formenti, Julien Provillard
      Pages 204-215

    14. Conservative Groupoids Recognize Only Regular Languages

      • Danny Dubé, Mario Latendresse, Pascal Tesson
      Pages 216-227
Back to top

Other volumes

  1. Language and Automata Theory and Applications

Keywords

About this book

This book constitutes the refereed proceedings of the 6th International Conference on Language and Automata Theory and Applications, LATA 2012, held in A Coruña, Spain in March 2012. The 41 revised full papers presented together with 3 invited talks and 2 invited tutorials were carefully reviewed and selected from 114 initial submissions. The volume features contributions from both classical theory fields and application areas; e.g. innformatics, systems biology, language technology, artificial intelligence, etc. 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

Bibliographic Information

Publish with us

Policies and ethics

Back to top

Search

Navigation