Language and Automata Theory and Applications: 4th International Conference, LATA 2010, Trier, Germany, May 24-28, 2010, Proceedings / Edition 1

Paperback (Print)
Buy New
Buy New from
Used and New from Other Sellers
Used and New from Other Sellers
from $122.69
Usually ships in 1-2 business days
(Save 27%)
Other sellers (Paperback)
  • All (9) from $122.69   
  • New (6) from $122.69   
  • Used (3) from $127.87   

More About This Textbook


This book constitutes the proceedings of the 4th International Conference, LATA 2010, held in May 2010 in Trier, Germany. The 47 full papers presented were carefully selected from 115 submissions and focus on topics such as algebraic language theory , algorithmic learning, bioinformatics, computational biology, pattern recognition, program verification, term rewriting and tree machines.

Read More Show Less

Product Details

Table of Contents

Invited Talks

Complexity in Convex Languages Janusz Brzozowski 1

Three Learnable Models for the Description of Language Alexander Clark 16

Arbology: Trees and Pushdown Automata Borivoj Melichar 32

Analysis of Communicating Automata Anca Muscholl 50

Regular Papers

Complexity of the Satisfiability Problem for a Class of Propositional Schemata Vincent Aravantinos Ricardo Caferra Nicolas Peltier 58

A Simple n-Dimensional Intrinsically Universal Quantum Cellular Automaton Pablo Arrighi Jonathan Grattage 70

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

Abelian Square-Free Partial Words Francine Blanchet-Sadri Jane I. Kim Robert Mercas William Severa Sean Simmons 94

Avoidable Binary Patterns in Partial Words Francine Blanchet-Sadri Robert Mercas Sean Simmons Eric Weissenstein 106

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

Pregroup Grammars with Letter Promotions Wojciech Buszkowski Zhe Lin 130

A Hierarchical Classification of First-Order Recurrent Neural Networks Jérémie Cabessa Alessandro E.P. Villa 142

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

Agreement and Cliticization in Italian: A Pregroup Analysis Claudia Casadio 166

Geometricity of Binary Regular Languages Jean-Marc Champarnaud Jean-Philippe Dubernard Hadrien Jeanne 178

On the Expressive Power of FO[+] Christain Choffrut Andreas Malcher Carlo Mereghetti Beatrice Palano 190

Finding Consistent Categorial Grammars of Bounded Value: A Parameterized Approach Christophe Costa Florêncio Henning Fernau 202

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

On the Maximal Number of Cubic Runs in a String Maxime Crochemore Costas Iliopoulos Marcin Kubica Jakub Radoszewski Wojciech Rytter Tomasz Walen 227

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

Parametric Metric Interval Temporal Logic Barbara Di Giampaolo Salvatore La Torre Margherita Napoli 249

Short Witnesses and Accepting Lassos in ω-Automata Rüdiger Ehlers 261

Grammar-Based Compression in a Streaming Model Travis Gagie Pawel Gawrychowski 273

Simplifying Regular Expressions: A Quantitative Perspective Hermann Gruber Stefan Gulan 285

A Programming Language Tailored to the Specification and Solution of Differential Equations Describing Processes on Networks Reinhard Hemmerling Katarína Smolenová Winfried Kurth 297

The Inclusion Problem for Regular Expressions Dag Hovland 309

Learnability of Automatic Classes Sanjay Jain Qinglong Luo Frank Stephan 321

Untestable Properties Expressible with Four First-Order Quantifiers Charles Jordan Thomas Zeugmann 333

The Copying Power of Well-Nested Multiple Context-Free Grammars Makoto Kanazawa Sylvain Salvati 344

Post Correspondence Problem with Partially Commutative Alphalbets Barbara Klunder Wojciech Rytter 356

Reversible Pushdown Automata Martin Kutrib Andreas Malcher 368

String Extension Learning Using Lattices Anna Kasprzik Timo Kötzing 380

The Equivalence Problem of Deterministic Multitape Finite Automata: A New Proof of Solvability Using a Multidimensional Tape Alexander A. Letichevsky Arsen S. Shoukourian Samvel K. Shoukourian 392

Primitive Words are Unavoidable for Coutext-Free Languages Peter Leupold 403

Model Nonassociative Lambek Calculus with Assumptions: Complexity and Context-Freeness Zhe Lin 414

Hard Counting Problems for Partial Words Florin Manea Catalin Tiseanu 426

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

SA-REPC - Sequence Alignment with Regular Expression Path Constraint Nimrod Milo Tamar Pinhas Michal Ziv-Ukelson 451

CD-Systems of Stateless Deterministic R(1)-Automata Accept All Rational Trace Languages Benedek Nagy Friedrich Otto 463

A Boundary between Universality and Non-universality in Extended Spiking Neural P Systems Turlough Neary 475

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

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

A Randomized Numerical Aligner (rNA) Alberto Policriti Alexandru I. Tomescu Francesco Vezzi 512

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

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

Incremental Building in Peptide Computing to Solve Hamiltonian Path Problem Muthiah Sakthi Balan Parameswaran Seshan 549

Variable Automata over Infinite Alphabets Orna Grumberg Orna Kupferman Sarai Sheinvald 561

Some Minimality Results on Biresidual and Biseparable Automata Hellis Tamm 573

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

Chomsky-Schützenberger-Type Characterization of Multiple Context-Free Languages Ryo Yoshinaka Yuichi Kaji Hiroyuki Seki 596

Complexity of Guided Insertion-Deletion in RNA-Editing Hans Zantema 608

Author Index 621

Read More Show Less

Customer Reviews

Be the first to write a review
( 0 )
Rating Distribution

5 Star


4 Star


3 Star


2 Star


1 Star


Your Rating:

Your Name: Create a Pen Name or

Barnes & Review Rules

Our reader reviews allow you to share your comments on titles you liked, or didn't, with others. By submitting an online review, you are representing to Barnes & that all information contained in your review is original and accurate in all respects, and that the submission of such content by you and the posting of such content by Barnes & does not and will not violate the rights of any third party. Please follow the rules below to help ensure that your review can be posted.

Reviews by Our Customers Under the Age of 13

We highly value and respect everyone's opinion concerning the titles we offer. However, we cannot allow persons under the age of 13 to have accounts at or to post customer reviews. Please see our Terms of Use for more details.

What to exclude from your review:

Please do not write about reviews, commentary, or information posted on the product page. If you see any errors in the information on the product page, please send us an email.

Reviews should not contain any of the following:

  • - HTML tags, profanity, obscenities, vulgarities, or comments that defame anyone
  • - Time-sensitive information such as tour dates, signings, lectures, etc.
  • - Single-word reviews. Other people will read your review to discover why you liked or didn't like the title. Be descriptive.
  • - Comments focusing on the author or that may ruin the ending for others
  • - Phone numbers, addresses, URLs
  • - Pricing and availability information or alternative ordering information
  • - Advertisements or commercial solicitation


  • - By submitting a review, you grant to Barnes & and its sublicensees the royalty-free, perpetual, irrevocable right and license to use the review in accordance with the Barnes & Terms of Use.
  • - Barnes & reserves the right not to post any review -- particularly those that do not follow the terms and conditions of these Rules. Barnes & also reserves the right to remove any review at any time without notice.
  • - See Terms of Use for other conditions and disclaimers.
Search for Products You'd Like to Recommend

Recommend other products that relate to your review. Just search for them below and share!

Create a Pen Name

Your Pen Name is your unique identity on It will appear on the reviews you write and other website activities. Your Pen Name cannot be edited, changed or deleted once submitted.

Your Pen Name can be any combination of alphanumeric characters (plus - and _), and must be at least two characters long.

Continue Anonymously

    If you find inappropriate content, please report it to Barnes & Noble
    Why is this product inappropriate?
    Comments (optional)