List of Accepted Papers for LATA 2010

(alphabetically ordered)

1.Vincent Aravantinos, Ricardo Caferra, and Nicolas Peltier. Complexity of the Satisfiability Problem for a Class of Propositional Schemata

2.Pablo Arrighi and Jonathan Grattage. A Simple n-Dimensional Intrinsically Universal Quantum Cellular Automata

3.Abdullah N. Arslan. A Fast Longest Common Subsequence Algorithm for Similar Strings

4.Francine Blanchet-Sadri, Jane Kim, Robert Mercas, William Severa, and Sean Simmons. Abelian Square-Free Partial Words

5.Francine Blanchet-Sadri, Robert Mercas, Sean Simmons, and Eric Weissenstein. Avoidable Binary Patterns in Partial Words

6. Nicolas Bousquet and Christof Löding. Equivalence and Inclusion Problem for Strongly Unambiguous Büchi Automata

7.Wojciech Buszkowski and Zhe Lin. Pregroup Grammars with Letter Promotions

8. Jérémie Cabessa and Alessadro Villa. A Hierarchical Classification of First-Order Recurrent Neural Networks

9. Rafael Carrascosa, François Coste, Matthias Gallé, and Gabriel Infante-Lopez. Choosing Word Occurrences for the Smallest Grammar Problem

10.Claudia Casadio. Agreement and Cliticization in Italian: a Pregroup Analysis

11. Jean-Marc Champarnaud, Jean-Philippe Dubernard and Hadrien Jeanne. Geometricity of Binary Regular Languages

12.Christian Choffrut, Andreas Malcher, Carlo Mereghetti, and Beatrice Palano. On the Expressive Power of FO[+]

13.Christophe Costa Florêncio and Henning Fernau. Finding Consistent Categorial Grammars of Bounded Value: a Parameterized Approach

14. Stefano Crespi Reghizzi and Dino Mandrioli. Operator Precedence and the Visibly Pushdown Property

15.Maxime Crochemore, Costas Iliopoulos, Marcin Kubica, Jakub Radoszewski, Wojciech Rytter, and Tomasz Waleń. On the Maximal Number of Cubic Runs in a String

16.William Cruz-Santos and Guillermo Morales-Luna. On the Hamiltonian Operators for Adiabatic Quantum Reduction of SAT

17. Barbara Di Giampaolo, Salvatore La Torre, and Margherita Napoli. Parametric Metric Interval Temporal Logic

18. Rüdiger Ehlers. Short Witnesses and Accepting Lassos in omega-Automata

19. Travis Gagie and Paweł Gawrychowski. Grammar-Based Compression in a Streaming Model

20.Hermann Gruber and Stefan Gulan. Simplifying Regular Expressions. A Quantitative Perspective

21.Orna Grumberg, Orna Kupferman, and Sarai Sheinvald. Variable Automata over Infinite Alphabets

22.Reinhard Hemmerling, Katarína Smoleňová, and Winfried Kurth. A Programming Language Tailored to the Specification and Solution of Differential Equations Describing Processes on Networks

23.Dag Hovland. The Inclusion Problem for Regular Expressions

24.Sanjay Jain, Qinglong Luo and Frank Stephan. Learnability of Automatic Classes

25.Charles Jordan and Thomas Zeugmann. Untestable Properties Expressible with Four First-Order Quantifiers

26.Makoto Kanazawa and Sylvain Salvati. The Copying Power of Well-Nested Multiple Context-Free Grammars

27. Anna Kasprzik and Timo Kötzing. String Extension Learning using Lattices

28.Barbara Klunder and Wojciech Rytter. Post Correspondence Problem with Partially Commutative Alphabets

29.Martin Kutrib and Andreas Malcher. Reversible Pushdown Automata

30. Alexander Letichevsky, Arsen Shoukourian, and Samvel Shoukourian. The Equivalence Problem of Deterministic Multitape Finite Automata. A New Proof of Solvability Using a Multidimensional Tape

31.Peter Leupold. Primitive Words are Unavoidable  for Context-Free Languages

32. Zhe Lin. Modal Nonassociative Lambek Calculus with Assumptions: Complexity and Context-Freeness

33.Florin Manea and Cătălin Tiseanu. Hard Counting Problems for Partial Words

34. Tobias Marschall and Sven Rahmann. Exact Analysis of Horspool's and Sunday's Pattern Matching Algorithms with Probabilistic Arithmetic Automata

35.Nimrod Milo, Tamar Pinhas, and Michal Ziv-Ukelson. SA-REPC - Sequence Alignment with Regular Expression Path Constraint

36. Benedek Nagy and Friedrich Otto. CD-Systems of Stateless Deterministic R(1)-Automata Accept all Rational Trace Languages

37.Turlough Neary. A Boundary Between Universality and Non-Universality in Extended Spiking Neural P Systems

38.Rafael Peñaloza. Using Sums-of-Products for Non-standard Reasoning

39.Martin Plátek, František Mráz, and Markéta Lopatková. Restarting Automata with Structured Output And Functional Generative Description

40.Alberto Policriti, Alexandru I. Tomescu, and Francesco Vezzi. A Randomized Numerical Aligner (rNA)

41.Fernando Rosa-Velardo and Giorgio Delzanno. Language-based Comparison of Petri Nets with Black Tokens, Pure Names and Ordered Data

42. Neda Saeedloei and Gopal Gupta. Verifying Complex Continuous Real-Time Systems with Coinductive CLP(R)

43. Muthiah Sakthi Balan and Parameswaran Seshan. Incremental Building in Peptide Computing to Solve Hamiltonian Path Problem

44.Hellis Tamm. Some Minimality Results on Biresidual and Biseparable Automata

45. Frank Weinberg and Markus Nebel. Extending Stochastic Context-Free Grammars for an Application in Bioinformatics

46.Ryo Yoshinaka, Yuichi Kaji, and Hiroyuki Seki. Chomsky-Schutzenberger-Type Characterization of Multiple Context-Free Languages

47.Hans Zantema. Complexity of Guided Insertion-Deletion in RNA-editing