COCOON
2010
Springer
13 years 6 months ago
2010
Springer
COCOON
2009
Springer
13 years 7 months ago
2009
Springer
We present new and more efficient algorithms for regular language enumeration problems. The min-word problem is to find the lexicographically minimal word of length n accepted by ...
COCOON
2010
Springer
13 years 7 months ago
2010
Springer
COCOON
2010
Springer
13 years 7 months ago
2010
Springer
CPM
2009
Springer
13 years 7 months ago
2009
Springer
In this paper we present in detail a new efficient linear time and space suffix array construction algorithm(SACA), called the D-CriticalSubstring algorithm. The algorithm is built...
CPM
1995
Springer
13 years 8 months ago
1995
Springer
CPM
1995
Springer
13 years 8 months ago
1995
Springer
We consider strings which are succinctly described. The description is in terms of straight-line programs in which the constants are symbols and the only operation is the concaten...
COCOON
1995
Springer
13 years 8 months ago
1995
Springer
COCOON
1995
Springer
13 years 8 months ago
1995
Springer
COCOON
1995
Springer
13 years 8 months ago
1995
Springer
A Craig interpolant of two inconsistent theories is a formula which is true in one and false in the other. This paper gives an eificient method for constructing a Craig interpolant...