Skip to main content
SpringerLink
Log in
Book cover

Language and Automata Theory and Applications

4th International Conference, LATA 2010, Trier, Germany, May 24-28, 2010, Proceedings

  • Conference proceedings
  • © 2010

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

    1. Fachbereich IV - Informatik, Universität Trier, Trier, Germany

    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 6031)

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

Included in the following conference series:

Conference proceedings info: LATA 2010.

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 84.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book USD 109.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 (51 papers)

  1. Front Matter

    Download chapter PDF

  2. Invited Talks

    1. Complexity in Convex Languages

      • Janusz Brzozowski
      Pages 1-15

    2. Three Learnable Models for the Description of Language

      • Alexander Clark
      Pages 16-31

    3. Arbology: Trees and Pushdown Automata

      • Bořivoj Melichar
      Pages 32-49

    4. Analysis of Communicating Automata

      • Anca Muscholl
      Pages 50-57

  3. Regular Papers

    1. Complexity of the Satisfiability Problem for a Class of Propositional Schemata

      • Vincent Aravantinos, Ricardo Caferra, Nicolas Peltier
      Pages 58-69

    2. A Simple n-Dimensional Intrinsically Universal Quantum Cellular Automaton

      • Pablo Arrighi, Jonathan Grattage
      Pages 70-81

    3. A Fast Longest Common Subsequence Algorithm for Similar Strings

      • Abdullah N. Arslan
      Pages 82-93

    4. Abelian Square-Free Partial Words

      • Francine Blanchet-Sadri, Jane I. Kim, Robert Mercaş, William Severa, Sean Simmons
      Pages 94-105

    5. Avoidable Binary Patterns in Partial Words

      • Francine Blanchet-Sadri, Robert Mercaş, Sean Simmons, Eric Weissenstein
      Pages 106-117

    6. Equivalence and Inclusion Problem for Strongly Unambiguous Büchi Automata

      • Nicolas Bousquet, Christof Löding
      Pages 118-129

    7. Pregroup Grammars with Letter Promotions

      • Wojciech Buszkowski, Zhe Lin
      Pages 130-141

    8. A Hierarchical Classification of First-Order Recurrent Neural Networks

      • Jérémie Cabessa, Alessandro E. P. Villa
      Pages 142-153

    9. Choosing Word Occurrences for the Smallest Grammar Problem

      • Rafael Carrascosa, François Coste, Matthias Gallé, Gabriel Infante-Lopez
      Pages 154-165

    10. Agreement and Cliticization in Italian: A Pregroup Analysis

      • Claudia Casadio
      Pages 166-177

    11. Geometricity of Binary Regular Languages

      • Jean-Marc Champarnaud, Jean-Philippe Dubernard, Hadrien Jeanne
      Pages 178-189

    12. On the Expressive Power of FO[ + ]

      • Christian Choffrut, Andreas Malcher, Carlo Mereghetti, Beatrice Palano
      Pages 190-201

    13. Finding Consistent Categorial Grammars of Bounded Value: A Parameterized Approach

      • Christophe Costa Florêncio, Henning Fernau
      Pages 202-213

    14. Operator Precedence and the Visibly Pushdown Property

      • Stefano Crespi Reghizzi, Dino Mandrioli
      Pages 214-226

    15. On the Maximal Number of Cubic Runs in a String

      • Maxime Crochemore, Costas Iliopoulos, Marcin Kubica, Jakub Radoszewski, Wojciech Rytter, Tomasz Waleń
      Pages 227-238
Back to top

Other volumes

  1. Language and Automata Theory and Applications

Keywords

Editors and Affiliations

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

    Adrian-Horia Dediu, Carlos Martín-Vide

  • Fachbereich IV - Informatik, Universität Trier, Trier, Germany

    Henning Fernau

Bibliographic Information

Publish with us

Policies and ethics

Back to top

Search

Navigation