Adrian Horia Dediu, Carlos Martín-Vide, José Luis Sierra-Rodríguez, Bianca Truthe
Proceedings of the Eighth International Conference on Language and Automata Theory and Applications
LATA, 2014.

@proceedings{LATA-2014,
	address       = "Madrid, Spain",
	doi           = "10.1007/978-3-319-04921-2",
	editor        = "Adrian Horia Dediu and Carlos Martín-Vide and José Luis Sierra-Rodríguez and Bianca Truthe",
	isbn          = "978-3-319-04920-5",
	publisher     = "{Springer International Publishing}",
	series        = "{Lecture Notes in Computer Science}",
	title         = "{Proceedings of the Eighth International Conference on Language and Automata Theory and Applications}",
	volume        = 8370,
	year          = 2014,
}

Contents (49 items)

9 ×#automaton
7 ×#on the
5 ×#problem
4 ×#complexity
4 ×#network
4 ×#probability
4 ×#word
3 ×#graph
3 ×#logic
3 ×#morphism

LATA-2014-EsparzaLS

A Brief History of Strahler Numbers (JE, ML, MS), pp. 1–13.

LATA-2014-IbarraR #on the #problem

On the Parikh Membership Problem for FAs, PDAs, and CMs (OHI, BR), pp. 14–31.

LATA-2014-Khanna #random

Matchings, Random Walks, and Sampling (SK), pp. 32–33.

LATA-2014-SeidlK #analysis #data flow #interprocedural #xml

Interprocedural Information Flow Analysis of XML Processors (HS, MK), pp. 34–61.

LATA-2014-AbdullaAS #automaton #reachability

Computing Optimal Reachability Costs in Priced Dense-Timed Pushdown Automata (PAA, MFA, JS), pp. 62–75.

LATA-2014-AleksandrowiczABB

Formulae for Polyominoes on Twisted Cylinders (GA, AA, GB, RB), pp. 76–87.

LATA-2014-AnselmoGM #finite

Picture Codes with Finite Deciphering Delay (MA, DG, MM), pp. 88–100.

LATA-2014-ArroyoCMP #network

Networks of Polarized Evolutionary Processors Are Computationally Complete (FA, SGC, VM, SP), pp. 101–112.

LATA-2014-BednarovaG #automaton

Two Double-Exponential Gaps for Automata with a Limited Pushdown (ZB, VG), pp. 113–125.

LATA-2014-BeerenwinkelBBDP #graph

Covering Pairs in Directed Acyclic Graphs (NB, SB, PB, RD, YP), pp. 126–137.

LATA-2014-BellaouarCZ #kernel #performance #sequence #string

Efficient List-Based Computation of the String Subsequence Kernel (SB, HC, DZ), pp. 138–148.

LATA-2014-BerardC #revisited #synthesis

Channel Synthesis Revisited (BB, OC), pp. 149–160.

LATA-2014-BestD #bound #graph #petri net

Characterisation of the State Spaces of Live and Bounded Marked Graph Petri Nets (EB, RRD), pp. 161–172.

LATA-2014-Blanchet-SadriLSW

Computing Depths of Patterns (FBS, AL, SS, BW), pp. 173–185.

LATA-2014-MasseGHL #equation #morphism #word

Solving Equations on Words with Morphisms and Antimorphisms (ABM, SG, SH, ML), pp. 186–197.

LATA-2014-MasseTT #on the

On the Arithmetics of Discrete Figures (ABM, AMT, HT), pp. 198–209.

LATA-2014-BoyarKLL #on the #problem

On the List Update Problem with Advice (JB, SK, KSL, ALO), pp. 210–221.

LATA-2014-BreveglieriCM #network #parsing

Shift-Reduce Parsers for Transition Networks (LB, SCR, AM), pp. 222–235.

LATA-2014-BundalaZ #network #sorting

Optimal Sorting Networks (DB, JZ), pp. 236–247.

LATA-2014-CarapelleFGQ #satisfiability #word

Satisfiability for MTL and TPTL over Non-monotonic Data Words (CC, SF, OFG, KQ), pp. 248–259.

LATA-2014-CaronFM

(k, l)-Unambiguity and Quasi-Deterministic Structures: An Alternative for the Determinization (PC, MF, LM), pp. 260–272.

LATA-2014-Cerny #composition #morphism #multi #problem

Solutions to the Multi-dimensional Equal Powers Problem Constructed by Composition of Rectangular Morphisms (AC), pp. 273–284.

LATA-2014-DasST #encoding #graph #morphism

Succinct Encodings of Graph Isomorphism (BD, PS, JT), pp. 285–296.

LATA-2014-DennunzioFM #combinator

Extremal Combinatorics of Reaction Systems (AD, EF, LM), pp. 297–307.

LATA-2014-DingSXHMC #modelling #probability

Stochastic k-Tree Grammar and Its Application in Biomolecular Structure Modeling (LD, AS, XX, XH, RLM, LC), pp. 308–322.

LATA-2014-DrosteD #automaton #infinity #logic #word

Weighted Automata and Logics for Infinite Nested Words (MD, SD), pp. 323–334.

LATA-2014-DubourgJ #algebra #tool support

Algebraic Tools for the Overlapping Tile Product (ED, DJ), pp. 335–346.

LATA-2014-FelgenhauerT #analysis #automaton #reachability

Reachability Analysis with State-Compatible Automata (BF, RT), pp. 347–359.

LATA-2014-FinkbeinerT #linear #logic #modelling

Counting Models of Linear-Time Temporal Logic (BF, HT), pp. 360–371.

LATA-2014-FormentiHKP #complexity

ω-rational Languages: High Complexity Classes vs. Borel Hierarchy (EF, MH, MK, JP), pp. 372–383.

LATA-2014-GalleT #incremental #on the

On Context-Diverse Repeats and Their Incremental Computation (MG, MT), pp. 384–395.

LATA-2014-GantyR #order #verification

Ordered Counter-Abstraction — Refinable Subword Relations for Parameterized Verification (PG, AR), pp. 396–408.

LATA-2014-GwynneK #constraints #on the #satisfiability

On SAT Representations of XOR Constraints (MG, OK), pp. 409–420.

LATA-2014-Gysel #algorithm #problem

Minimal Triangulation Algorithms for Perfect Phylogeny Problems (RG), pp. 421–432.

LATA-2014-Kalocinski #on the

On Computability and Learnability of the Pumping Lemma Function (DK), pp. 433–440.

LATA-2014-KlaudelKD #algebra #logic #semantics

Interval Temporal Logic Semantics of Box Algebra (HK, MK, ZD), pp. 441–452.

LATA-2014-KleinMBK #automaton #model checking #probability #question

Are Good-for-Games Automata Good for Probabilistic Model Checking? (JK, DM, CB, SK), pp. 453–465.

LATA-2014-KoHS #top-down

Top-Down Tree Edit-Distance of Regular Tree Languages (SKK, YSH, KS), pp. 466–477.

LATA-2014-KonitzerS #automaton #bound #process

DFA with a Bounded Activity Level (MK, HUS), pp. 478–489.

LATA-2014-LaurenceLNST #learning #transducer

Learning Sequential Tree-to-Word Transducers (GL, AL, JN, SS, MT), pp. 490–502.

LATA-2014-LiPT #probability #process #simulation

Probabilistic Simulation for Probabilistic Data-Aware Business Processes (HL, FP, FT), pp. 503–515.

LATA-2014-Martos-SalgadoR #network #petri net

Expressiveness of Dynamic Networks of Timed Petri Nets (MMS, FRV), pp. 516–527.

LATA-2014-MazadiGZ #pattern matching

Distinguishing Pattern Languages with Membership Examples (ZM, ZG, SZ), pp. 528–540.

LATA-2014-OttoM #automaton #order

Extended Two-Way Ordered Restarting Automata for Picture Languages (FO, FM), pp. 541–552.

LATA-2014-Prusa #complexity

Weight-Reducing Hennie Machines and Their Descriptional Complexity (DP), pp. 553–564.

LATA-2014-Tarau #product line

Computing with Catalan Families (PT), pp. 565–575.

LATA-2014-Vorel #automaton #complexity #problem #word

Complexity of a Problem Concerning Reset Words for Eulerian Binary Automata (VV), pp. 576–587.

LATA-2014-Weidner #probability #regular expression

Probabilistic ω-Regular Expressions (TW), pp. 588–600.

LATA-2014-ZhengGQ #automaton #complexity #finite #on the

On the State Complexity of Semi-quantum Finite Automata (SZ, JG, DQ), pp. 601–612.