448 search results - page 1 / 90 » Dynamic Algorithms for the Dyck Languages |
WADS
1995
Springer
13 years 10 months ago
1995
Springer
BIOCOMP
2008
13 years 8 months ago
2008
A Dyck shift and a Motzkin shift are mathematical models for constraints on genetic sequences. In terms of the theory of symbolic dynamics, neither of the Dyck shift nor the Motzki...
ESOP
2009
Springer
13 years 11 months ago
2009
Springer
The context-free language (CFL) reachability problem is well known and studied in computer science, as a fundamental problem underlying many important static analyses such as point...
PLDI
2004
ACM
14 years 13 days ago
2004
ACM
Many program analyses can be reduced to graph reachability problems involving a limited form of context-free language reachability called Dyck-CFL reachability. We show a new redu...
CADE
2003
Springer
14 years 7 months ago
2003
Springer
We propose a practical path-based framework for deriving and simplifying source-tracking information for term unification in the empty theory. Such a framework is useful for debugg...