Templates are used to generate all kinds of text, including computer code. The last decade,
the use of templates gained a lot of popularity due to the increase of dynamic web …

The theory of formal string languages and of formal tree languages are both important parts
of the theory of formal languages. Regular tree languages are recognized by finite tree …

String suffix automata accept all suffixes of a given string and belong to the fundamental
stringology principles. Extending their transitions by specific pushdown operations results in …

Tree pattern matching on ordered trees is an important problem in Computer Science.
Ordered trees can be represented as strings with additional properties via various …

Software variants of a Software Product Line (SPL) consist of a set of artifacts specified by
features. Variability models document the valid relationships between features and their …

Abstract top We present a unified and systematic approach to basic principles of Arbology, a
new algorithmic discipline focusing on algorithms on trees. Stringology, a highly developed …

Subtree matching is an important problem in Computer Science on which a number of tasks,
such as mechanical theorem proving, term-rewriting, symbolic computation and …

A new taxonomy of sublinear (multiple) keyword pattern matching algorithms is presented.
Based on an earlier taxonomy by the second and third authors, this new taxonomy includes …

Subtree matching is an important problem in Computer Science on which a number of tasks,
such as mechanical theorem proving, term-rewriting, symbolic computation and non …

Trees are (data) structures used in many areas of human activity. Tree as the formal notion
has been introduced in the theory of graphs. Nevertheless, trees have been used a long …