Titlebook: Language and Automata Theory and Applications; 9th International Co Adrian-Horia Dediu,Enrico Formenti,Bianca Truthe Conference proceedings

阻挡

Conference proceedings 2015in Nice, France in March 2015. The 53 revised full papers presented together with 5 invited talks were carefully reviewed and selected from 115 submissions. The papers cover the following topics: algebraic language theory; algorithms for semi-structured data mining, algorithms on automata and words;

暴露他抗议

An Efficient Best-Trees Algorithm for Weighted Tree Automata over the Tropical Semiringe, again over the tropical semiring, and the output is a set of . trees with minimal weight. We prove that the algorithm is correct, and that its time complexity is a low polynomial in . and the relevant size parameters of ..

强化

Hyaluronic-Acid

Hankel Matrices: From Words to Graphs (Extended Abstract) .-definable graph parameters, there are uncountably many graph parameters . with Hankel matrices of finite rank. We also discuss how real-valued graph parameters can be replaced by graph parameters with values in commutative semirings.

mercenary

Complexity Classes for Membrane Systems: A Surveyrelated to the definition of time/space complexity classes for membrane systems will be discussed, and the resulting hierarchy will be compared with the usual hierarchy of complexity classes, mainly through simulations of Turing Machines by (uniform families of) membrane systems with active membranes.

傻瓜

Average-Case Optimal Approximate Circular String Matchingime .. Optimal average-case search time can also be achieved by the algorithms for multiple approximate string matching (Fredriksson and Navarro, 2004) using . and its rotations as the set of multiple patterns. Here we reduce the preprocessing time and space requirements compared to that approach.

CRAB

Building Bridges Between Sets of Partial Ordersgorithms make use of an intermediate mathematical formalism, called Conditional Labeled Event Structures (CLESs), which combines the advantages of LESs and CPOGs. All three formalisms are compared on a number of benchmarks.

Glucose

Weak and Nested Class Memory Automatang the weakness constraint recovers decidability of emptiness, via reduction to coverability in well-structured transition systems. We also examine connections with existing automata over nested data.

爱好

玉米棒子

Construction of a de Bruijn Graph for Assembly from a Truncated Suffix Treeis, it is important to enable the community to reuse an existing index to build the DBG directly from it. In an earlier work we provided the first algorithms when starting from a suffix tree or suffix array. Here, we exhibit an algorithm that exploits a reduced version of the truncated suffix tree a