Skip to search formSkip to main contentSkip to account menu
Theory of computation
TLDR
This chapter discusses models for Finite Automata Regular Expressions Context-Free Grammars Pushdown Automata Turing Machines Functions, Relations, and Translations, and properties of these models.
One-Unambiguous Regular Languages
TLDR
A Kleene theorem is able to prove the decidability of whether a given regular expression denotes a 1-unambiguous language; if it does, then it can be proved that an equivalent 1- unambiguous regular expression can be constructed in worst-case optimal time.
View via Publisher
Regular tree and regular hedge languages over unranked alphabets
A fluid line coupling socket for quick attachment and release from a nipple, the socket having locking pins for retaining and releasing the nipple, the pins having a pair of generally oppositely…
A survey of adaptive sorting algorithms
TLDR
This survey presents the basic notions and concepts of adaptive sorting, the demonstration that several algorithms currently in use are adaptive, and the development of new algorithms, similar to currently used algorithms that perform competitively on random sequences and are significantly faster on nearly sorted sequences.
View on ACM
An Optimal Worst Case Algorithm for Reporting Intersections of Rectangles
TLDR
This paper investigates the problem of reporting all intersecting pairs in a set of n rectilinearly oriented rectangles in the plane and describes an algorithm that solves this problem in worst case time proportional to n lg n + k, where k is the number of interesecting pairs found.
View on IEEE
Stabbing line segments
TLDR
An algorithm for the geometric problem of determining a line (called a stabbing line) which intersects each ofn given line segments in the plane and a purely geometric fact is proved which infers that this description requiresO(n) space to be specified.
View on Springer
Concurrency control in database structures with relaxed balance
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…
View on ACM
A Note on Some Tree Similarity Measures
View via Publisher
Grail: A C++ Library for Automata and Expressions
Abstract Grail is a package for symbolic manipulation of finite-state automata and regular expressions. It provides most standard operations on automata and expressions, including minimization,…
View via Publisher
On the Definition and Computation of Rectlinear Convex Hulls
View via Publisher
...
...
By clicking accept or continuing to use the site, you agree to the terms outlined in our Privacy Policy, Terms of Service, and Dataset License