The ISO standard for the Standard Generalized Markup Language (SGML) provides a syntactic meta-language for the definition of textual markup systems. In the standard, the right-hand sides ofâ€¦ (More)

We survey the basic results on regular tree languages over unranked alphabets; that is, we use an unranked alphabet for the labels of nodes, we allow unbounded, yet regular, degree nodes and we treatâ€¦ (More)

The design and analysis of adaptive sorting algorithms has made important contributions to both theory and practice. The main contributions from the theoretical point of view are: the description ofâ€¦ (More)

Problem 1 (25 points) Prove that E is closed under linear-time reductions. (A class C is closed under linear-time reductions if whenever L is reducible to Lâ€² and Lâ€² âˆˆ C, then L âˆˆ C. ) Proof: Supposeâ€¦ (More)

In this paper we investigate the problem of reporting all intersecting pairs in a set of n rectilinearly oriented rectangles in the plane. This problem arises in applications such as design ruleâ€¦ (More)

Given two structures of the same type, one standard question is: how close are these two structures to each other? One example is the string-to-string correction problem (see [3,7,9] for example), aâ€¦ (More)

Grail is a package for symbolic manipulation of nite-state automata and regular expressions. It provides most standard operations on automata and expressions, including minimization, subsetâ€¦ (More)

We consider the separation of rebalancing from updates in several database structures, such as B-trees for external and AVL-trees for internal structures. We show how this separation can beâ€¦ (More)

We consider the use of state elimination to construct shorter regular expressions from finite-state automata (FAs). Although state elimination is an intuitive method for computing regular expressionsâ€¦ (More)