Skip to main content
  • Conference proceedings
  • © 2010

Language and Automata Theory and Applications

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

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

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

Conference proceedings info: LATA 2010.

Buy it now

Buying options

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

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

Table of contents (51 papers)

  1. Front Matter

  2. Invited Talks

    1. Complexity in Convex Languages

      • Janusz Brzozowski
      Pages 1-15
    2. Arbology: Trees and Pushdown Automata

      • Bořivoj Melichar
      Pages 32-49
    3. 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. Abelian Square-Free Partial Words

      • Francine Blanchet-Sadri, Jane I. Kim, Robert Mercaş, William Severa, Sean Simmons
      Pages 94-105
    3. Avoidable Binary Patterns in Partial Words

      • Francine Blanchet-Sadri, Robert Mercaş, Sean Simmons, Eric Weissenstein
      Pages 106-117
    4. Equivalence and Inclusion Problem for Strongly Unambiguous Büchi Automata

      • Nicolas Bousquet, Christof Löding
      Pages 118-129
    5. Pregroup Grammars with Letter Promotions

      • Wojciech Buszkowski, Zhe Lin
      Pages 130-141
    6. A Hierarchical Classification of First-Order Recurrent Neural Networks

      • Jérémie Cabessa, Alessandro E. P. Villa
      Pages 142-153
    7. Choosing Word Occurrences for the Smallest Grammar Problem

      • Rafael Carrascosa, François Coste, Matthias Gallé, Gabriel Infante-Lopez
      Pages 154-165
    8. Geometricity of Binary Regular Languages

      • Jean-Marc Champarnaud, Jean-Philippe Dubernard, Hadrien Jeanne
      Pages 178-189
    9. On the Expressive Power of FO[ + ]

      • Christian Choffrut, Andreas Malcher, Carlo Mereghetti, Beatrice Palano
      Pages 190-201
    10. Finding Consistent Categorial Grammars of Bounded Value: A Parameterized Approach

      • Christophe Costa Florêncio, Henning Fernau
      Pages 202-213
    11. Operator Precedence and the Visibly Pushdown Property

      • Stefano Crespi Reghizzi, Dino Mandrioli
      Pages 214-226
    12. 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

Other Volumes

  1. Language and Automata Theory and Applications

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

Buy it now

Buying options

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