6. LATA 2012: Tarragona, Spain
Adrian Horia Dediu, Carlos Martín-Vide (Eds.): Language and Automata Theory and Applications - 6th International Conference, LATA 2012, A Coruña, Spain, March 5-9, 2012. Proceedings. Springer 2012 Lecture Notes in Computer Science ISBN 978-3-642-28331-4
Invited Talks
- Eugene Asarin: Measuring Information in Timed Languages. 1-2
- Bernard Boigelot, Julien Brusten, Jean-François Degbomont: Automata-Based Symbolic Representations of Polyhedra. 3-20
- Gilles Dowek: Around the Physical Church-Turing Thesis: Cellular Automata, Formal Languages, and the Principles of Quantum Theory. 21-37
- Rod Downey: A Parameterized Complexity Tutorial. 38-56
- Jack H. Lutz: The Computer Science of DNA Nanotechnology. 57
Regular Papers
- Parosh Aziz Abdulla, Mohamed Faouzi Atig, Jari Stenman: The Minimal Cost Reachability Problem in Priced Timed Pushdown Systems. 58-69
- Siva Anantharaman, Christopher Bouchard, Paliath Narendran, Michaël Rusinowitch: Unification Modulo Chaining. 70-82
- Vikraman Arvind, Yadu Vasudev: Isomorphism Testing of Boolean Functions Computable by Constant-Depth Circuits. 83-94
- Holger Bock Axelsen: Reversible Multi-head Finite Automata Characterize Reversible Logarithmic Space. 95-105
- Philip Bille, Inge Li Gørtz, Jesper Kristensen: Longest Common Extensions via Fingerprinting. 119-130
- Philip Bille, Morten Stöckel: Fast and Cache-Oblivious Dynamic Programming with Local Dependencies. 131-142
- Beate Bollig, Tobias Pröger: An Efficient Implicit OBDD-Based Algorithm for Maximal Matchings. 143-154
- Laura Bozzelli: Strong Termination for Gap-Order Constraint Abstractions of Counter Systems. 155-168
- Julien Cervelle: Covering Space in the Besicovitch Topology. 169-178
- Jean-Marc Champarnaud, Hadrien Jeanne, Ludovic Mignot: Approximate Regular Expressions and Their Derivatives. 179-191
- Alberto Dennunzio, Enrico Formenti, Julien Provillard: Computational Complexity of Rule Distributions of Non-uniform Cellular Automata. 204-215
- Danny Dubé, Mario Latendresse, Pascal Tesson: Conservative Groupoids Recognize Only Regular Languages. 216-227
- Michal Forisek, Lucia Keller, Monika Steinová: Advice Complexity of Online Coloring for Paths. 228-239
- Travis Gagie, Pawel Gawrychowski, Juha Kärkkäinen, Yakov Nekrich, Simon J. Puglisi: A Faster Grammar-Based Self-index. 240-251
- Viliam Geffert, Bruno Guillon, Giovanni Pighizzini: Two-Way Automata Making Choices Only at the Endmarkers. 264-276
- Michael Geilke, Sandra Zilles: Polynomial-Time Algorithms for Learning Typed Pattern Languages. 277-288
- Daniela Genova: Forbidding Sets and Normal Forms for Language Forbidding-Enforcing Systems. 289-300
- Stefan Hetzl: Applying Tree Languages in Proof Theory. 301-312
- Dag Hovland: The Membership Problem for Regular Expressions with Unordered Concatenation and Numerical Constraints. 313-324
- Norbert Hundeshagen, Friedrich Otto: Characterizing the Rational Functions by Restarting Transducers. 325-336
- Oscar H. Ibarra, Nicholas Q. Trân: Weak Synchronization and Synchronizability of Multitape Pushdown Automata and Turing Machines. 337-350
- Ahmet Kara, Thomas Schwentick, Tony Tan: Feasible Automata for Two-Variable Logic with Successor on Data Words. 351-362
- Miroslav Klimos, Kim G. Larsen, Filip Stefanak, Jeppe Thaarup: Nash Equilibria in Concurrent Priced Games. 363-376
- Arne Meier, Johannes Schmidt, Michael Thomas, Heribert Vollmer: On the Parameterized Complexity of Default Logic and Autoepistemic Logic. 389-400
- Alexei Miasnikov, Zoran Sunic: Cayley Graph Automatic Groups Are Not Necessarily Cayley Graph Biautomatic. 401-407
- Mathilde Noual: Dynamics of Circuits and Intersecting Circuits. 433-444
- Mateus de Oliveira Oliveira: Canonizable Partial Order Generators. 445-457
- Max Rabkin: Ogden's Lemma for ET0L Languages. 458-467
- Adam Roman: P-NP Threshold for Synchronizing Road Coloring. 480-489
- Ville Salo, Ilkka Törmä: On Stable and Unstable Limit Sets of Finite Families of Cellular Automata. 502-513
- Adam Woryna: Automaton Ranks of Some Self-similar Groups. 514-525
- Tomoyuki Yamakami: One-Way Reversible and Quantum Finite Automata with Advice. 526-537
- Ryo Yoshinaka: Integration of the Dual Approaches in the Distributional Learning of Context-Free Grammars. 538-550
data released under the ODC-BY 1.0 license. See also our legal information page
last updated on 2013-06-17T203403 by the dblp team