Champarnaud and Ziadi, and Khorsi et al. show how to compute the equation automaton of word regular expression E via the k-CContinuations. Kuske and Meinecke extend the computation of the equation automaton to a regular tree expression E over a ranked alphabet Σ and produce a O(R · |E |) time and space complexity algorithm, where R is the maximal rank of a symbol occurring in Σ and |E | is the ...

Preface I wrote these lecture notes during my stay in Aarhus in the academic year 1974/75. As a young researcher I had a wonderful time at DAIMI, and I have always been happy to have had that early experience. I wish to thank Heiko Vogler for his noble plan to move these notes into the digital world, and I am grateful to Florian Starke and Markus Napierkowski (and Heiko) for the excellent trans...

The measure of regular languages, recently introduced in technical literature, has been the driving force for quantitative analysis and synthesis of discrete-event supervisory (DES) control systems dealing with finite state automata (equivalently, regular languages). This paper extends the signed real measure of regular languages, to a complex measure of non-regular languages, generated by line...

In this paper, I outline a new algorithm for regular tree pattern matching. The Boyer-Moore family of string pattern matching algorithms are considered to be among the most e cient. The Boyer-Moore idea of a shift distance was generalized by Commentz-Walter for multiple keywords, and generalizations for regular expressions have also been found. The existence of a further generalization to tree ...

Regular tree expressions are a natural formalism for describing the sets of tree-structured values that commonly arise in programs; thus, they are well-suited to applications in program analysis. We describe an implementation of regular tree expressions and our experience with that implementation in the context of the FL type system. A combination of algorithms, optimizations, and fast heuristi...

In this paper, we present a multi-frontal solver algorithm for the adaptive finite element method expressed by graph grammar productions. The graph grammar productions construct first the binary elimination tree, and then process frontal matrices stored in distributed manner in nodes of the elimination tree. The solver is specialized for a class of one, two and three dimensional h refined meshe...

This paper describes a general and powerful method for dependence analysis in the presence of recursive data constructions. The particular analysis presented is for identifying partially dead recursive data, but the general framework for representing and manipulating recursive substruc-tures applies to all dependence analyses. The method uses projections based on general regular tree grammars e...