Adrian Horia Dediu, Enrico Formenti, Carlos Martín-Vide, Bianca Truthe
Proceedings of the Ninth International Conference on Language and Automata Theory and Applications
LATA, 2015.

@proceedings{LATA-2015,
	address       = "Nice, France",
	doi           = "10.1007/978-3-319-15579-1",
	editor        = "Adrian Horia Dediu and Enrico Formenti and Carlos Martín-Vide and Bianca Truthe",
	isbn          = "978-3-319-15578-4",
	publisher     = "{Springer International Publishing}",
	series        = "{Lecture Notes in Computer Science}",
	title         = "{Proceedings of the Ninth International Conference on Language and Automata Theory and Applications}",
	volume        = 8977,
	year          = 2015,
}

Contents (58 items)

10 ×#automaton
7 ×#on the
6 ×#complexity
6 ×#word
4 ×#bound
4 ×#problem
3 ×#2d
3 ×#game studies
3 ×#graph
3 ×#logic

LATA-2015-AutiliIMST #automation #specification #synthesis

Automated Synthesis of Application-Layer Connectors from Automata-Based Specifications (MA, PI, FM, RS, MT), pp. 3–24.

LATA-2015-FarzanHHKP #automation #verification

Automated Program Verification (AF, MH, JH, ZK, AP), pp. 25–46.

LATA-2015-MakowskyL #graph #matrix #word

Hankel Matrices: From Words to Graphs (JAM, NL), pp. 47–55.

LATA-2015-MauriLMPZ #complexity #overview

Complexity Classes for Membrane Systems: A Survey (GM, AL, LM, AEP, CZ), pp. 56–69.

LATA-2015-Restivo #research

The Shuffle Product: New Research Directions (AR), pp. 70–81.

LATA-2015-BartonIP #approximate #string

Average-Case Optimal Approximate Circular String Matching (CB, CSI, SPP), pp. 85–96.

LATA-2015-BjorklundDZ #algorithm #automaton #performance

An Efficient Best-Trees Algorithm for Weighted Tree Automata over the Tropical Semiring (JB, FD, NZ), pp. 97–108.

LATA-2015-CazauxLR #assembly #graph

Construction of a de Bruijn Graph for Assembly from a Truncated Suffix Tree (BC, TL, ER), pp. 109–120.

LATA-2015-ChoHK #mining

Frequent Pattern Mining with Non-overlapping Inversions (DJC, YSH, HK), pp. 121–132.

LATA-2015-DaiW #algorithm #parallel #random #sequence

A Parallel Algorithm for Finding All Minimal Maximum Subsequences via Random Walk (HKD, ZW), pp. 133–144.

LATA-2015-LeonM #partial order #set

Building Bridges Between Sets of Partial Orders (HPdL, AM), pp. 145–160.

LATA-2015-VorelR #complexity #word

Complexity of Road Coloring with Prescribed Reset Words (VV, AR), pp. 161–172.

LATA-2015-BoiretHNT #constraints #logic

Logics for Unordered Trees with Data Constraints on Siblings (AB, VH, JN, RT), pp. 175–187.

LATA-2015-Cotton-BarrattMO #automaton #memory management

Weak and Nested Class Memory Automata (CCB, ASM, CHLO), pp. 188–199.

LATA-2015-EremondiIM #bound

Insertion Operations on Deterministic Reversal-Bounded Counter Machines (JE, OHI, IM), pp. 200–211.

LATA-2015-GonzeJ #on the #probability

On the Synchronizing Probability Function and the Triple Rendezvous Time — New Approaches to Černý’s Conjecture (FG, RMJ), pp. 212–223.

LATA-2015-HalavaNP #game studies #on the

On Robot Games of Degree Two (VH, RN, IP), pp. 224–236.

LATA-2015-KrishnaMT #automaton #bound #decidability #problem #reachability #recursion

Time-Bounded Reachability Problem for Recursive Timed Automata is Undecidable (SNK, LM, AT), pp. 237–248.

LATA-2015-LiH #algebra #automaton #network #on the

On Observability of Automata Networks via Computational Algebra (RL, YH), pp. 249–262.

LATA-2015-Peltier #approach #reasoning

Reasoning on Schemas of Formulas: An Automata-Based Approach (NP), pp. 263–274.

LATA-2015-SulzmannT

Derivatives for Regular Shuffle Expressions (MS, PT), pp. 275–286.

LATA-2015-ThiemannS #automaton #regular expression

From ω-Regular Expressions to Büchi Automata via Partial Derivatives (PT, MS), pp. 287–298.

LATA-2015-VerdierR #constraints #reachability #specification

Quotient of Acceptance Specifications Under Reachability Constraints (GV, JBR), pp. 299–311.

LATA-2015-AnselmoGM #2d #decidability

Structure and Measure of a Decidable Class of Two-dimensional Codes (MA, DG, MM), pp. 315–327.

LATA-2015-GodinKP #automaton #on the

On Torsion-Free Semigroups Generated by Invertible Reversible Mealy Automata (TG, IK, MP), pp. 328–339.

LATA-2015-LopezN

Coding Non-orientable Laminations (LML, PN), pp. 340–352.

LATA-2015-Panteleev #sequence

Preset Distinguishing Sequences and Diameter of Transformation Semigroups (PP), pp. 353–364.

LATA-2015-Zinoviadis #2d #finite

Hierarchy and Expansiveness in 2D Subshifts of Finite Type (CZ), pp. 365–377.

LATA-2015-BadkobehFL #on the #word

On the Number of Closed Factors in a Word (GB, GF, ZL), pp. 381–390.

LATA-2015-FiciLLP #online

Online Computation of Abelian Runs (GF, TL, AL, ÉPG), pp. 391–401.

LATA-2015-GamardR #2d

Coverability in Two Dimensions (GG, GR), pp. 402–413.

LATA-2015-HadravovaH #equation #word

Equation xⁱyʲxᵏ=uⁱvʲuᵏ in Words (JH, SH), pp. 414–423.

LATA-2015-MikulskiPR #commutative #word

Square-Free Words over Partially Commutative Alphabets (LM, MP, WR), pp. 424–435.

LATA-2015-NayakK #on the #word

On the Language of Primitive Partial Words (ACN, KK), pp. 436–445.

LATA-2015-AllenderM #complexity

Complexity of Regular Functions (EA, IM), pp. 449–460.

LATA-2015-AmanoS #bound #multi #polynomial

A Nonuniform Circuit Class with Multilayer of Threshold Gates Having Super Quasi Polynomial Size Lower Bounds Against NEXP (KA, AS), pp. 461–472.

LATA-2015-BachmeierLS #automaton #complexity #finite

Finite Automata for the Sub- and Superword Closure of CFLs: Descriptional and Computational Complexity (GB, ML, MS), pp. 473–485.

LATA-2015-BeyersdorffCS #game studies

A Game Characterisation of Tree-like Q-resolution Size (OB, LC, KS), pp. 486–498.

LATA-2015-BilottaPPR #problem

Recurrence Relations, Succession Rules, and the Positivity Problem (SB, EP, RP, SR), pp. 499–510.

LATA-2015-BresolinMMSS #complexity #logic #on the

On the Complexity of Fragments of the Modal Logic of Allen’s Relations over Dense Structures (DB, DDM, AM, PS, GS), pp. 511–523.

LATA-2015-CreignouKMMOV #problem

Parameterized Enumeration for Modification Problems (NC, RK, AM, JSM, FO, HV), pp. 524–536.

LATA-2015-DennunzioFMP #problem

Preimage Problems for Reaction Systems (AD, EF, LM, AEP), pp. 537–548.

LATA-2015-LuckMS #complexity #theorem

Parameterized Complexity of CTL — A Generalization of Courcelle’s Theorem (ML, AM, IS), pp. 549–560.

LATA-2015-Salem #automaton #ltl #model checking #testing

Single-Pass Testing Automata for LTL Model Checking (AEBS), pp. 563–576.

LATA-2015-BilleGV #data type

Compressed Data Structures for Range Searching (PB, ILG, SV), pp. 577–586.

LATA-2015-PolicritiGP #linear

Average Linear Time and Compressed Space Construction of the Burrows-Wheeler Transform (AP, NG, NP), pp. 587–598.

LATA-2015-TravnicekJMC #pattern matching

Backward Linearised Tree Pattern Matching (JT, JJ, BM, LGC), pp. 599–610.

LATA-2015-UlyantsevZS #automaton #identification #symmetry

BFS-Based Symmetry Breaking Predicates for DFA Identification (VU, IZ, AS), pp. 611–622.

LATA-2015-Yoshinaka #boolean grammar #grammar inference #learning

Learning Conjunctive Grammars and Contextual Binary Feature Grammars (RY), pp. 623–635.

LATA-2015-BaillyDR

Recognizable Series on Hypergraphs (RB, FD, GR), pp. 639–651.

LATA-2015-BoichutCR #approximate #precise #towards

Towards More Precise Rewriting Approximations (YB, JC, PR), pp. 652–663.

LATA-2015-CodishCS #game studies #network #sorting

Sorting Networks: The End Game (MC, LCF, PSK), pp. 664–675.

LATA-2015-DabrowskiHP #bound #clique #graph

Bounding Clique-Width via Perfect Graphs (KKD, SH, DP), pp. 676–688.

LATA-2015-JanickiKKM #order #subclass

Order Structures for Subclasses of Generalised Traces (RJ, JK, MK, LM), pp. 689–700.

LATA-2015-BabariD #automaton #logic #theorem

A Nivat Theorem for Weighted Picture Automata and Weighted MSO Logic (PB, MD), pp. 703–715.

LATA-2015-BoassonC

Rational Selecting Relations and Selectors (LB, OC), pp. 716–726.

LATA-2015-LeupoldH

A Hierarchy of Transducing Observer Systems (PL, NH), pp. 727–738.

LATA-2015-NdioneLN #sublinear

Sublinear DTD Validity (AN, AL, JN), pp. 739–751.