Language and Automata Theory and Applications: 8th International Conference, LATA 2014, Madrid, Spain, March 10-14, 2014. Proceedings

Front Matter....Pages I-XIV
A Brief History of Strahler Numbers....Pages 1-13
On the Parikh Membership Problem for FAs, PDAs, and CMs....Pages 14-31
Matchings, Random Walks, and Sampling....Pages 32-33
Interprocedural Information Flow Analysis of XML Processors....Pages 34-61
Computing Optimal Reachability Costs in Priced Dense-Timed Pushdown Automata....Pages 62-75
Formulae for Polyominoes on Twisted Cylinders....Pages 76-87
Picture Codes with Finite Deciphering Delay....Pages 88-100
Networks of Polarized Evolutionary Processors Are Computationally Complete....Pages 101-112
Two Double-Exponential Gaps for Automata with a Limited Pushdown....Pages 113-125
Covering Pairs in Directed Acyclic Graphs....Pages 126-137
Efficient List-Based Computation of the String Subsequence Kernel....Pages 138-148
Channel Synthesis Revisited....Pages 149-160
Characterisation of the State Spaces of Live and Bounded Marked Graph Petri Nets....Pages 161-172
Computing Depths of Patterns....Pages 173-185
Solving Equations on Words with Morphisms and Antimorphisms....Pages 186-197
On the Arithmetics of Discrete Figures....Pages 198-209
On the List Update Problem with Advice....Pages 210-221
Shift-Reduce Parsers for Transition Networks....Pages 222-235
Optimal Sorting Networks....Pages 236-247
Satisfiability for MTL and TPTL over Non-monotonic Data Words....Pages 248-259
(k,l)-Unambiguity and Quasi-Deterministic Structures: An Alternative for the Determinization....Pages 260-272
Solutions to the Multi-dimensional Equal Powers Problem Constructed by Composition of Rectangular Morphisms....Pages 273-284
Succinct Encodings of Graph Isomorphism....Pages 285-296
Extremal Combinatorics of Reaction Systems....Pages 297-307
Stochastic k -Tree Grammar and Its Application in Biomolecular Structure Modeling....Pages 308-322
Weighted Automata and Logics for Infinite Nested Words....Pages 323-334
Algebraic Tools for the Overlapping Tile Product....Pages 335-346
Reachability Analysis with State-Compatible Automata....Pages 347-359
Counting Models of Linear-Time Temporal Logic....Pages 360-371
 ω -rational Languages: High Complexity Classes vs. Borel Hierarchy....Pages 372-383
On Context-Diverse Repeats and Their Incremental Computation....Pages 384-395
Ordered Counter-Abstraction....Pages 396-408
On SAT Representations of XOR Constraints....Pages 409-420
Minimal Triangulation Algorithms for Perfect Phylogeny Problems....Pages 421-432
On Computability and Learnability of the Pumping Lemma Function....Pages 433-440
Interval Temporal Logic Semantics of Box Algebra....Pages 441-452
Are Good-for-Games Automata Good for Probabilistic Model Checking?....Pages 453-465
Top-Down Tree Edit-Distance of Regular Tree Languages....Pages 466-477
DFA with a Bounded Activity Level....Pages 478-489
Learning Sequential Tree-to-Word Transducers....Pages 490-502
Probabilistic Simulation for Probabilistic Data-Aware Business Processes....Pages 503-515
Expressiveness of Dynamic Networks of Timed Petri Nets....Pages 516-527
Distinguishing Pattern Languages with Membership Examples....Pages 528-540
Extended Two-Way Ordered Restarting Automata for Picture Languages....Pages 541-552
Weight-Reducing Hennie Machines and Their Descriptional Complexity....Pages 553-564
Computing with Catalan Families....Pages 565-575
Complexity of a Problem Concerning Reset Words for Eulerian Binary Automata....Pages 576-587
Probabilistic ω -Regular Expressions....Pages 588-600
On the State Complexity of Semi-quantum Finite Automata....Pages 601-612
Back Matter....Pages -