Adrian Horia Dediu, Carlos Martín-Vide
Proceedings of the Sixth International Conference on Language and Automata Theory and Applications
LATA, 2012.

@proceedings{LATA-2012,
	address       = "A Coruña, Spain",
	doi           = "10.1007/978-3-642-28332-1",
	editor        = "Adrian Horia Dediu and Carlos Martín-Vide",
	isbn          = "978-3-642-28331-4",
	publisher     = "{Springer International Publishing}",
	series        = "{Lecture Notes in Computer Science}",
	title         = "{Proceedings of the Sixth International Conference on Language and Automata Theory and Applications}",
	volume        = 7183,
	year          = 2012,
}

Contents (46 items)

11 ×#automaton
4 ×#complexity
3 ×#finite
3 ×#on the
3 ×#performance
3 ×#regular expression
3 ×#set
2 ×#algorithm
2 ×#constraints
2 ×#context-free grammar

LATA-2012-Asarin #information management

Measuring Information in Timed Languages (EA), pp. 1–2.

LATA-2012-BoigelotBD

Automata-Based Symbolic Representations of Polyhedra (BB, JB, JFD), pp. 3–20.

LATA-2012-Dowek #automaton #formal method #physics #quantum

Around the Physical Church-Turing Thesis: Cellular Automata, Formal Languages, and the Principles of Quantum Theory (GD), pp. 21–37.

LATA-2012-Downey #complexity #tutorial

A Parameterized Complexity Tutorial (RD), pp. 38–56.

LATA-2012-Lutz

The Computer Science of DNA Nanotechnology (JHL), p. 57.

LATA-2012-AbdullaAS #automaton #low cost #problem #reachability

The Minimal Cost Reachability Problem in Priced Timed Pushdown Systems (PAA, MFA, JS), pp. 58–69.

LATA-2012-AnantharamanBNR #unification

Unification Modulo Chaining (SA, CB, PN, MR), pp. 70–82.

LATA-2012-ArvindV #morphism #testing

Isomorphism Testing of Boolean Functions Computable by Constant-Depth Circuits (VA, YV), pp. 83–94.

LATA-2012-Axelsen #automaton #finite #multi

Reversible Multi-head Finite Automata Characterize Reversible Logarithmic Space (HBA), pp. 95–105.

LATA-2012-BarashO #context-free grammar

Defining Contexts in Context-Free Grammars (MB, AO), pp. 106–118.

LATA-2012-BilleGK

Longest Common Extensions via Fingerprinting (PB, ILG, JK), pp. 119–130.

LATA-2012-BilleS #dependence #performance #programming

Fast and Cache-Oblivious Dynamic Programming with Local Dependencies (PB, MS), pp. 131–142.

LATA-2012-BolligP #algorithm #performance

An Efficient Implicit OBDD-Based Algorithm for Maximal Matchings (BB, TP), pp. 143–154.

LATA-2012-Bozzelli #abstraction #constraints #termination

Strong Termination for Gap-Order Constraint Abstractions of Counter Systems (LB), pp. 155–168.

LATA-2012-Cervelle

Covering Space in the Besicovitch Topology (JC), pp. 169–178.

LATA-2012-ChamparnaudJM #approximate #regular expression

Approximate Regular Expressions and Their Derivatives (JMC, HJ, LM), pp. 179–191.

LATA-2012-CiobanuP #petri net

Catalytic Petri Nets Are Turing Complete (GC, GMP), pp. 192–203.

LATA-2012-DennunzioFP #automaton #complexity

Computational Complexity of Rule Distributions of Non-uniform Cellular Automata (AD, EF, JP), pp. 204–215.

LATA-2012-DubeLT #regular expression

Conservative Groupoids Recognize Only Regular Languages (DD, ML, PT), pp. 216–227.

LATA-2012-ForisekKS #complexity #online

Advice Complexity of Online Coloring for Paths (MF, LK, MS), pp. 228–239.

LATA-2012-GagieGKNP #grammarware #performance #self

A Faster Grammar-Based Self-index (TG, PG, JK, YN, SJP), pp. 240–251.

LATA-2012-GaoS

Learnability of Co-r.e. Classes (ZG, FS), pp. 252–263.

LATA-2012-GeffertGP #automaton

Two-Way Automata Making Choices Only at the Endmarkers (VG, BG, GP), pp. 264–276.

LATA-2012-GeilkeZ #algorithm #learning #pattern matching #polynomial

Polynomial-Time Algorithms for Learning Typed Pattern Languages (MG, SZ), pp. 277–288.

LATA-2012-Genova #normalisation #set

Forbidding Sets and Normal Forms for Language Forbidding-Enforcing Systems (DG), pp. 289–300.

LATA-2012-Hetzl #proving

Applying Tree Languages in Proof Theory (SH), pp. 301–312.

LATA-2012-Hovland #constraints #problem #regular expression

The Membership Problem for Regular Expressions with Unordered Concatenation and Numerical Constraints (DH), pp. 313–324.

LATA-2012-HundeshagenO #transducer

Characterizing the Rational Functions by Restarting Transducers (NH, FO), pp. 325–336.

LATA-2012-IbarraT #automaton #multi #turing machine

Weak Synchronization and Synchronizability of Multitape Pushdown Automata and Turing Machines (OHI, NQT), pp. 337–350.

LATA-2012-KaraST #automaton #logic #word

Feasible Automata for Two-Variable Logic with Successor on Data Words (AK, TS, TT), pp. 351–362.

LATA-2012-KlimosLST #concurrent #game studies #nash

Nash Equilibria in Concurrent Priced Games (MK, KGL, FS, JT), pp. 363–376.

LATA-2012-KrassovitskiyL

Computing by Observing Insertion (AK, PL), pp. 377–388.

LATA-2012-MeierSTV #complexity #logic #on the

On the Parameterized Complexity of Default Logic and Autoepistemic Logic (AM, JS, MT, HV), pp. 389–400.

LATA-2012-MiasnikovS #automation #graph

Cayley Graph Automatic Groups Are Not Necessarily Cayley Graph Biautomatic (AM, ZS), pp. 401–407.

LATA-2012-TangO #automaton #model checking #on the

On Model Checking for Visibly Pushdown Automata (NVT, HO), pp. 408–419.

LATA-2012-NikolicS #analysis #array

Automaton-Based Array Initialization Analysis (DN, FS), pp. 420–432.

LATA-2012-Noual

Dynamics of Circuits and Intersecting Circuits (MN), pp. 433–444.

LATA-2012-Oliveira #generative #partial order

Canonizable Partial Order Generators (MdOO), pp. 445–457.

LATA-2012-Rabkin

Ogden’s Lemma for ET0L Languages (MR), pp. 458–467.

LATA-2012-ReidenbachS #bound

Patterns with Bounded Treewidth (DR, MLS), pp. 468–479.

LATA-2012-Roman

P-NP Threshold for Synchronizing Road Coloring (AR), pp. 480–489.

LATA-2012-RowlandS #set

k-Automatic Sets of Rational Numbers (ER, JS), pp. 490–501.

LATA-2012-SaloT #automaton #finite #on the #product line #set

On Stable and Unstable Limit Sets of Finite Families of Cellular Automata (VS, IT), pp. 502–513.

LATA-2012-Woryna #automaton #self

Automaton Ranks of Some Self-similar Groups (AW), pp. 514–525.

LATA-2012-Yamakami #automaton #finite #quantum

One-Way Reversible and Quantum Finite Automata with Advice (TY), pp. 526–537.

LATA-2012-Yoshinaka #context-free grammar #integration #learning

Integration of the Dual Approaches in the Distributional Learning of Context-Free Grammars (RY), pp. 538–550.