6th International Conference on Language and Automata Theory and Applications (LATA 2012)

• Bernard Boigelot: Automata-based Symbolic Representations of Polyhedra

• Eric Rowland and Jeffrey Shallit: k-Automatic Sets of Rational Numbers

• Daniela Genova: Forbidding Sets and Normal Forms for Language Forbidding-Enforcing Systems

• Gilles Dowek: Around the Physical Church-Turing Thesis: Cellular Automata, Formal Languages, and the Principles of Quantum Theory (I)

• Oscar H. Ibarra and Nicholas Q. Tran: Weak Synchronization and Synchronizability of Multitape Pushdown Automata and Turing Machines

• Tang Van Nguyen and Hitoshi Ohsaki: On Model Checking for Visibly Pushdown Automata

• Parosh Aziz Abdulla, Mohamed Faouzi Atig, and Jari Stenman: The Minimal Cost Reachability Problem in Priced Timed Pushdown Systems

• Alexander Krassovitskiy and Peter Leupold: Computing by Observing Insertion

• Alexei Miasnikov and Zoran Šunić: Cayley Graph Automatic Groups are not necessarily Cayley Graph Biautomatic

• Julien Cervelle: Covering Space in the Besicovitch Topology

• Danny Dubé, Mario Latendresse, and Pascal Tesson: Conservative Groupoids Recognize only Regular Languages

• Stefan Hetzl: Applying Tree Languages in Proof Theory

• Max Rabkin: Ogden's Lemma for ET0L Languages

• Daniel Reidenbach and Markus L. Schmid: Patterns with Bounded Treewidth

• Mikhail Barash and Alexander Okhotin: Defining Contexts in Context-free Grammars

• Laura Bozzelli: Strong Termination for Gap-order Constraint Abstractions of Counter Systems

• Eugene Asarin: Measuring Information in Timed Languages

• Gilles Dowek: Around the Physical Church-Turing Thesis: Cellular Automata, Formal Languages, and the Principles of Quantum Theory (II)

• Dag Hovland: The Membership Problem for Regular Expressions with Unordered Concatenation and Numerical Constraints

• Jean-Marc Champarnaud, Hadrien Jeanne, and Ludovic Mignot: Approximate Regular Expressions and their Derivatives

• Viliam Geffert, Bruno Guillon, and Giovanni Pighizzini: Two-way Automata Making Choices only at the Endmarkers

• Holger Bock Axelsen: Reversible Multi-head Finite Automata Characterize Reversible Logarithmic Space

• Siva Anantharaman, Christopher Bouchard, Paliath Narendran, and Michael Rusinowitch: Unification Modulo Chaining

• Beate Bollig and Tobias Pröger: An Efficient Implicit OBDD-based Algorithm for Maximal Matchings

• Travis Gagie, Paweł Gawrychowski, Juha Kärkkäinen, Yakov Nekrich, and Simon J. Puglisi: A Faster Grammar-based Self-index

• Gabriel Ciobanu and G. Michele Pinna: Catalytic Petri Nets are Turing Complete

• Tomoyuki Yamakami: One-way Reversible and Quantum Finite Automata with Advice

• Ville Salo and Ilkka Törmä: On Stable and Unstable Limit Sets of Finite Families of Cellular Automata

• Alberto Dennunzio, Enrico Formenti, and Julien Provillard: Computational Complexity of Rule Distributions of Non-uniform Cellular Automata

• Rod Downey: A Parameterized Complexity Tutorial (I)

• Adam Roman: P-NP Threshold for Synchronizing Road Coloring

• Arne Meier, Johannes Schmidt, Michael Thomas, and Heribert Vollmer: On the Parameterized Complexity of Default Logic and Autoepistemic Logic

• Michal Forišek, Lucia Keller, and Monika Steinová: Advice Complexity of Online Coloring for Paths

• Mateus de Oliveira Oliveira: Canonizable Partial Order Generators

• Mathilde Noual: Dynamics of Circuits and Intersecting Circuits

• Norbert Hundeshagen and Friedrich Otto: Characterizing the Rational Functions by Restarting Transducers

• Ahmet Kara, Thomas Schwentick, and Tony Tan: Feasible Automata for Two-variable Logic with Successor on Data Words

• Miroslav Klimoš, Kim G. Larsen, Filip Štefaňák, and Jeppe Thaarup: Nash Equilibria in Concurrent Priced Games

• Ryo Yoshinaka: Integration of the Dual Approaches in the Distributional Learning of Context-free Grammars

• Ziyuan Gao and Frank Stephan: Learnability of Co-r.e. Classes

• Michael Geilke and Sandra Zilles: Polynomial-time Algorithms for Learning Typed Pattern Languages

• Jack H. Lutz: The Computer Science of DNA Nanotechnology

• Rod Downey: A Parameterized Complexity Tutorial (II)

• Philip Bille, Inge Li Gørtz, and Jesper Kristensen: Longest Common Extensions via Fingerprinting

• Vikraman Arvind and Yadu Vasudev: Isomorphism Testing of Boolean Functions Computable by Constant-depth Circuits

• Đurica Nikolić and Fausto Spoto: Automaton-based Array Initialization Analysis

• Philip Bille and Morten Stöckel: Fast and Cache-oblivious Dynamic Programming with Local Dependencies