Advertisement

Language and Automata Theory and Applications

6th International Conference, LATA 2012, A Coruña, Spain, March 5-9, 2012. Proceedings

  • Adrian-Horia Dediu
  • Carlos Martín-Vide
Conference proceedings LATA 2012

Part of the Lecture Notes in Computer Science book series (LNCS, volume 7183)

Table of contents

  1. Front Matter
    PDF

  2. Invited Talks

    1. Measuring Information in Timed Languages
      Eugene Asarin
      Pages 1-2
    2. Automata-Based Symbolic Representations of Polyhedra
      Bernard Boigelot, Julien Brusten, Jean-François Degbomont
      Pages 3-20
    3. Around the Physical Church-Turing Thesis: Cellular Automata, Formal Languages, and the Principles of Quantum Theory
      Gilles Dowek
      Pages 21-37
    4. A Parameterized Complexity Tutorial
      Rod Downey
      Pages 38-56
    5. The Computer Science of DNA Nanotechnology
      Jack H. Lutz
      Pages 57-57
      PDF

  3. Regular Papers

    1. The Minimal Cost Reachability Problem in Priced Timed Pushdown Systems
      Parosh Aziz Abdulla, Mohamed Faouzi Atig, Jari Stenman
      Pages 58-69
    2. Unification Modulo Chaining
      Siva Anantharaman, Christopher Bouchard, Paliath Narendran, Michael Rusinowitch
      Pages 70-82
    3. Isomorphism Testing of Boolean Functions Computable by Constant-Depth Circuits
      Vikraman Arvind, Yadu Vasudev
      Pages 83-94
    4. Reversible Multi-head Finite Automata Characterize Reversible Logarithmic Space
      Holger Bock Axelsen
      Pages 95-105
    5. Defining Contexts in Context-Free Grammars
      Mikhail Barash, Alexander Okhotin
      Pages 106-118
    6. Longest Common Extensions via Fingerprinting
      Philip Bille, Inge Li Gørtz, Jesper Kristensen
      Pages 119-130
    7. Fast and Cache-Oblivious Dynamic Programming with Local Dependencies
      Philip Bille, Morten Stöckel
      Pages 131-142
    8. An Efficient Implicit OBDD-Based Algorithm for Maximal Matchings
      Beate Bollig, Tobias Pröger
      Pages 143-154
    9. Strong Termination for Gap-Order Constraint Abstractions of Counter Systems
      Laura Bozzelli
      Pages 155-168
    10. Covering Space in the Besicovitch Topology
      Julien Cervelle
      Pages 169-178
    11. Approximate Regular Expressions and Their Derivatives
      Jean-Marc Champarnaud, Hadrien Jeanne, Ludovic Mignot
      Pages 179-191
    12. Catalytic Petri Nets Are Turing Complete
      Gabriel Ciobanu, G. Michele Pinna
      Pages 192-203
    13. Computational Complexity of Rule Distributions of Non-uniform Cellular Automata
      Alberto Dennunzio, Enrico Formenti, Julien Provillard
      Pages 204-215
    14. Conservative Groupoids Recognize Only Regular Languages
      Danny Dubé, Mario Latendresse, Pascal Tesson
      Pages 216-227
    15. Advice Complexity of Online Coloring for Paths
      Michal Forišek, Lucia Keller, Monika Steinová
      Pages 228-239
    16. A Faster Grammar-Based Self-index
      Travis Gagie, Paweł Gawrychowski, Juha Kärkkäinen, Yakov Nekrich, Simon J. Puglisi
      Pages 240-251
    17. Learnability of Co-r.e. Classes
      Ziyuan Gao, Frank Stephan
      Pages 252-263
    18. Two-Way Automata Making Choices Only at the Endmarkers
      Viliam Geffert, Bruno Guillon, Giovanni Pighizzini
      Pages 264-276
    19. Polynomial-Time Algorithms for Learning Typed Pattern Languages
      Michael Geilke, Sandra Zilles
      Pages 277-288
    20. Forbidding Sets and Normal Forms for Language Forbidding-Enforcing Systems
      Daniela Genova
      Pages 289-300
    21. Applying Tree Languages in Proof Theory
      Stefan Hetzl
      Pages 301-312
    22. The Membership Problem for Regular Expressions with Unordered Concatenation and Numerical Constraints
      Dag Hovland
      Pages 313-324
    23. Characterizing the Rational Functions by Restarting Transducers
      Norbert Hundeshagen, Friedrich Otto
      Pages 325-336
    24. Weak Synchronization and Synchronizability of Multitape Pushdown Automata and Turing Machines
      Oscar H. Ibarra, Nicholas Q. Tran
      Pages 337-350
    25. Feasible Automata for Two-Variable Logic with Successor on Data Words
      Ahmet Kara, Thomas Schwentick, Tony Tan
      Pages 351-362
    26. Nash Equilibria in Concurrent Priced Games
      Miroslav Klimoš, Kim G. Larsen, Filip Štefaňák, Jeppe Thaarup
      Pages 363-376
    27. Computing by Observing Insertion
      Alexander Krassovitskiy, Peter Leupold
      Pages 377-388
    28. On the Parameterized Complexity of Default Logic and Autoepistemic Logic
      Arne Meier, Johannes Schmidt, Michael Thomas, Heribert Vollmer
      Pages 389-400
    29. Cayley Graph Automatic Groups Are Not Necessarily Cayley Graph Biautomatic
      Alexei Miasnikov, Zoran Šunić
      Pages 401-407
    30. On Model Checking for Visibly Pushdown Automata
      Tang Van Nguyen, Hitoshi Ohsaki
      Pages 408-419
    31. Automaton-Based Array Initialization Analysis
      Đurica Nikolić, Fausto Spoto
      Pages 420-432
    32. Dynamics of Circuits and Intersecting Circuits
      Mathilde Noual
      Pages 433-444
    33. Canonizable Partial Order Generators
      Mateus de Oliveira Oliveira
      Pages 445-457
    34. Ogden’s Lemma for ET0L Languages
      Max Rabkin
      Pages 458-467
    35. Patterns with Bounded Treewidth
      Daniel Reidenbach, Markus L. Schmid
      Pages 468-479
    36. P–NP Threshold for Synchronizing Road Coloring
      Adam Roman
      Pages 480-489
    37. k-Automatic Sets of Rational Numbers
      Eric Rowland, Jeffrey Shallit
      Pages 490-501
    38. On Stable and Unstable Limit Sets of Finite Families of Cellular Automata
      Ville Salo, Ilkka Törmä
      Pages 502-513
    39. Automaton Ranks of Some Self-similar Groups
      Adam Woryna
      Pages 514-525
    40. One-Way Reversible and Quantum Finite Automata with Advice
      Tomoyuki Yamakami
      Pages 526-537
    41. Integration of the Dual Approaches in the Distributional Learning of Context-Free Grammars
      Ryo Yoshinaka
      Pages 538-550
  4. Back Matter
    PDF

About these proceedings

Introduction

This book constitutes the refereed proceedings of the 6th International Conference on Language and Automata Theory and Applications, LATA 2012, held in A Coruña, Spain in March 2012. The 41 revised full papers presented together with 3 invited talks and 2 invited tutorials were carefully reviewed and selected from 114 initial submissions. The volume features contributions from both classical theory fields and application areas; e.g. innformatics, systems biology, language technology, artificial intelligence, etc. Among the topics covered are algebraic language theory, automata and logic, systems analysis, systems verifications, computational complexity, decidability, unification, graph transformations, language-based cryptography, and applications in data mining, computational learning, and pattern recognition.

Keywords

dynamical systems formal languages model checking numerical constraints regular expressions

Editors and affiliations

  • Adrian-Horia Dediu
    • 1
  • Carlos Martín-Vide
    • 1
  1. 1.Research Group on Mathematical LinguisticsUniversitat Rovira i VirgiliTarragonaSpain

Bibliographic information

  • DOI https://doi.org/10.1007/978-3-642-28332-1
  • Copyright Information Springer-Verlag GmbH Berlin Heidelberg 2012
  • Publisher Name Springer, Berlin, Heidelberg
  • eBook Packages Computer Science
  • Print ISBN 978-3-642-28331-4
  • Online ISBN 978-3-642-28332-1
  • Series Print ISSN 0302-9743
  • Series Online ISSN 1611-3349
  • Buy this book on publisher's site
Industry Sectors
Biotechnology
Electronics
IT & Software
Telecommunications