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.
Lecture Notes in Computer Science 7183 Springer 2012, ISBN 978-3-642-28331-4 
Invited Talks
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
- Mikhail Barash, Alexander Okhotin:
Defining Contexts in Context-Free Grammars.
106-118
- 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
- Gabriel Ciobanu, G. Michele Pinna:
Catalytic Petri Nets Are Turing Complete.
192-203
- 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
- Ziyuan Gao, Frank Stephan:
Learnability of Co-r.e. Classes.
252-263
- 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
- Alexander Krassovitskiy, Peter Leupold:
Computing by Observing Insertion.
377-388
- 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
- Nguyen Van Tang, Hitoshi Ohsaki:
On Model Checking for Visibly Pushdown Automata.
408-419
- Durica Nikolic, Fausto Spoto:
Automaton-Based Array Initialization Analysis.
420-432
- 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
- Daniel Reidenbach, Markus L. Schmid:
Patterns with Bounded Treewidth.
468-479
- Adam Roman:
P-NP Threshold for Synchronizing Road Coloring.
480-489
- Eric Rowland, Jeffrey Shallit:
k-Automatic Sets of Rational Numbers.
490-501
- 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
Last update Tue May 21 17:40:19 2013
CET by the DBLP Team — 
Data released under the ODC-BY 1.0 license — See also our legal information page
