4. LATA 2010: Trier, Germany

Invited Talks

• Janusz A. Brzozowski:
  Complexity in Convex Languages. 1-15
  
• Alexander Clark:
  Three Learnable Models for the Description of Language. 16-31
  
• Borivoj Melichar:
  Arbology: Trees and Pushdown Automata. 32-49
  
• Anca Muscholl:
  Analysis of Communicating Automata. 50-57
  

Regular Papers

• Vincent Aravantinos, Ricardo Caferra, Nicolas Peltier:
  Complexity of the Satisfiability Problem for a Class of Propositional Schemata. 58-69
  
• Pablo Arrighi, Jonathan Grattage:
  A Simple n-Dimensional Intrinsically Universal Quantum Cellular Automaton. 70-81
  
• Abdullah N. Arslan:
  A Fast Longest Common Subsequence Algorithm for Similar Strings. 82-93
  
• Francine Blanchet-Sadri, Jane I. Kim, Robert Mercas, William Severa, Sean Simmons:
  Abelian Square-Free Partial Words. 94-105
  
• Francine Blanchet-Sadri, Robert Mercas, Sean Simmons, Eric Weissenstein:
  Avoidable Binary Patterns in Partial Words. 106-117
  
• Nicolas Bousquet, Christof Löding:
  Equivalence and Inclusion Problem for Strongly Unambiguous Büchi Automata. 118-129
  
• Wojciech Buszkowski, Zhe Lin:
  Pregroup Grammars with Letter Promotions. 130-141
  
• Jérémie Cabessa, Alessandro E. P. Villa:
  A Hierarchical Classification of First-Order Recurrent Neural Networks. 142-153
  
• Rafael Carrascosa, François Coste, Matthias Gallé, Gabriel G. Infante López:
  Choosing Word Occurrences for the Smallest Grammar Problem. 154-165
  
• Claudia Casadio:
  Agreement and Cliticization in Italian: A Pregroup Analysis. 166-177
  
• Jean-Marc Champarnaud, Jean-Philippe Dubernard, Hadrien Jeanne:
  Geometricity of Binary Regular Languages. 178-189
  
• Christian Choffrut, Andreas Malcher, Carlo Mereghetti, Beatrice Palano:
  On the Expressive Power of FO[ + ]. 190-201
  
• Christophe Costa Florêncio, Henning Fernau:
  Finding Consistent Categorial Grammars of Bounded Value: A Parameterized Approach. 202-213
  
• Stefano Crespi-Reghizzi, Dino Mandrioli:
  Operator Precedence and the Visibly Pushdown Property. 214-226
  
• Maxime Crochemore, Costas S. Iliopoulos, Marcin Kubica, Jakub Radoszewski, Wojciech Rytter, Tomasz Walen:
  On the Maximal Number of Cubic Runs in a String. 227-238
  
• William Cruz-Santos, Guillermo Morales-Luna:
  On the Hamiltonian Operators for Adiabatic Quantum Reduction of SAT. 239-248
  
• Barbara Di Giampaolo, Salvatore La Torre, Margherita Napoli:
  Parametric Metric Interval Temporal Logic. 249-260
  
• Rüdiger Ehlers:
  Short Witnesses and Accepting Lassos in omega-Automata. 261-272
  
• Travis Gagie, Pawel Gawrychowski:
  Grammar-Based Compression in a Streaming Model. 273-284
  
• Hermann Gruber, Stefan Gulan:
  Simplifying Regular Expressions. 285-296
  
• Reinhard Hemmerling, Katarína Smolenová, Winfried Kurth:
  A Programming Language Tailored to the Specification and Solution of Differential Equations Describing Processes on Networks. 297-308
  
• Dag Hovland:
  The Inclusion Problem for Regular Expressions. 309-320
  
• Sanjay Jain, Qinglong Luo, Frank Stephan:
  Learnability of Automatic Classes. 321-332
  
• Charles Jordan, Thomas Zeugmann:
  Untestable Properties Expressible with Four First-Order Quantifiers. 333-343
  
• Makoto Kanazawa, Sylvain Salvati:
  The Copying Power of Well-Nested Multiple Context-Free Grammars. 344-355
  
• Barbara Klunder, Wojciech Rytter:
  Post Correspondence Problem with Partially Commutative Alphabets. 356-367
  
• Martin Kutrib, Andreas Malcher:
  Reversible Pushdown Automata. 368-379
  
• Anna Kasprzik, Timo Kötzing:
  String Extension Learning Using Lattices. 380-391
  
• Alexander A. Letichevsky, Arsen S. Shoukourian, Samvel K. Shoukourian:
  The Equivalence Problem of Deterministic Multitape Finite Automata: A New Proof of Solvability Using a Multidimensional Tape. 392-402
  
• Peter Leupold:
  Primitive Words Are Unavoidable for Context-Free Languages. 403-413
  
• Zhe Lin:
  Modal Nonassociative Lambek Calculus with Assumptions: Complexity and Context-Freeness. 414-425
  
• Florin Manea, Catalin Tiseanu:
  Hard Counting Problems for Partial Words. 426-438
  
• Tobias Marschall, Sven Rahmann:
  Exact Analysis of Horspool's and Sunday's Pattern Matching Algorithms with Probabilistic Arithmetic Automata. 439-450
  
• Nimrod Milo, Tamar Pinhas, Michal Ziv-Ukelson:
  SA-REPC - Sequence Alignment with Regular Expression Path Constraint. 451-462
  
• Benedek Nagy, Friedrich Otto:
  CD-Systems of Stateless Deterministic R(1)-Automata Accept All Rational Trace Languages. 463-474
  
• Turlough Neary:
  A Boundary between Universality and Non-universality in Extended Spiking Neural P Systems. 475-487
  
• Rafael Peñaloza:
  Using Sums-of-Products for Non-standard Reasoning. 488-499
  
• Martin Plátek, Frantisek Mráz, Markéta Lopatková:
  Restarting Automata with Structured Output and Functional Generative Description. 500-511
  
• Alberto Policriti, Alexandru I. Tomescu, Francesco Vezzi:
  A Randomized Numerical Aligner (rNA). 512-523
  
• Fernando Rosa-Velardo, Giorgio Delzanno:
  Language-Based Comparison of Petri Nets with Black Tokens, Pure Names and Ordered Data. 524-535
  
• Neda Saeedloei, Gopal Gupta:
  Verifying Complex Continuous Real-Time Systems with Coinductive CLP(R). 536-548
  
• Muthiah Sakthi Balan, Parameswaran Seshan:
  Incremental Building in Peptide Computing to Solve Hamiltonian Path Problem. 549-560
  
• Orna Grumberg, Orna Kupferman, Sarai Sheinvald:
  Variable Automata over Infinite Alphabets. 561-572
  
• Hellis Tamm:
  Some Minimality Results on Biresidual and Biseparable Automata. 573-584
  
• Frank Weinberg, Markus E. Nebel:
  Extending Stochastic Context-Free Grammars for an Application in Bioinformatics. 585-595
  
• Ryo Yoshinaka, Yuichi Kaji, Hiroyuki Seki:
  Chomsky-Schützenberger-Type Characterization of Multiple Context-Free Languages. 596-607
  
• Hans Zantema:
  Complexity of Guided Insertion-Deletion in RNA-Editing. 608-619
  

Last update Thu May 23 17:38:15 2013 CET by the DBLP Team — Data released under the ODC-BY 1.0 license — See also our legal information page