Language and Automata Theory and Applications

1. Front Matter

   PDF

2. Invited Talks

   1. Recent Developments in Algorithmic Teaching

      • Frank J. Balbach, Thomas Zeugmann

      Pages 1-18

   2. Monadic Second-Order Logic for Graphs: Algorithmic and Language Theoretical Applications

      • Bruno Courcelle

      Pages 19-22

   3. Descriptional and Computational Complexity of Finite Automata

      • Markus Holzer, Martin Kutrib

      Pages 23-42

   4. Hypothesis Spaces for Learning

      • Sanjay Jain

      Pages 43-58

   5. State Complexity of Nested Word Automata

      • Kai Salomaa

      Pages 59-70

3. Regular Papers

   1. A Language-Based Comparison of Extensions of Petri Nets with and without Whole-Place Operations

      • Parosh Aziz Abdulla, Giorgio Delzanno, Laurent Van Begin

      Pages 71-82

   2. Minimal Union-Free Decompositions of Regular Languages

      • Sergey Afonin, Denis Golomazov

      Pages 83-92

   3. Commutative Regular Shuffle Closed Languages, Noetherian Property, and Learning Theory

      • Yohji Akama

      Pages 93-104

   4. Matching Trace Patterns with Regular Policies

      • Franz Baader, Andreas Bauer, Alwen Tiu

      Pages 105-116

   5. Absolute Convergence of Rational Series Is Semi-decidable

      • Raphaël Bailly, François Denis

      Pages 117-128

   6. Non-solvable Groups Are Not in FO+MOD+MÂJ2[REG]

      • Christoph Behle, Andreas Krebs, Stephanie Reifferscheid

      Pages 129-140

   7. Reoptimization of Traveling Salesperson Problems: Changing Single Edge-Weights

      • Tobias Berg, Harald Hempel

      Pages 141-151

   8. Refinement and Consistency of Timed Modal Specifications

      • Nathalie Bertrand, Sophie Pinchinat, Jean-Baptiste Raclet

      Pages 152-163

   9. Nondeterministic Instance Complexity and Proof Systems with Advice

      • Olaf Beyersdorff, Johannes Köbler, Sebastian Müller

      Pages 164-175

   10. How Many Holes Can an Unbordered Partial Word Contain?

       • Francine Blanchet-Sadri, Emily Allen, Cameron Byrum, Robert Mercaş

       Pages 176-187

   11. An Answer to a Conjecture on Overlaps in Partial Words Using Periodicity Algorithms

       • Francine Blanchet-Sadri, Robert Mercaş, Abraham Rashin, Elara Willett

       Pages 188-199

   12. Partial Projection of Sets Represented by Finite Automata, with Application to State-Space Visualization

       • Bernard Boigelot, Jean-François Degbomont

       Pages 200-211

   13. Larger Lower Bounds on the OBDD Complexity of Integer Multiplication

       • Beate Bollig

       Pages 212-223

   14. Picture Languages Generated by Assembling Tiles

       • Paola Bonizzoni, Claudio Ferretti, Anthonath Roslin Sagaya Mary, Giancarlo Mauri

       Pages 224-235

This book constitutes the refereed proceedings of the Third International Conference on Language and Automata Theory and Applications, LATA 2009, held in Tarragona, Spain, in April 2009. The 58 revised full papers presented together with 3 invited lectures and two tutorials were carefully reviewed and selected from 121 submissions. The papers address all the various issues related to automata theory and formal languages.

• Automat
• Chomsky grammar
• LA
• automata
• automata theory
• cellular automata
• combinatorics on words
• communication complexity
• complexity space
• computability
• computational biology
• context-free grammar
• denotational semanti
• formal language
• formal languages

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

  Adrian Horia Dediu

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

  Armand Mihai Ionescu

• European Research Council Executive Agency, Brussels, Belgium

  Carlos Martín-Vide

Policies and ethics