773 search results - page 79 / 155 » Suffix Trees on Words |
STACS
2001
Springer
15 years 4 months ago
2001
Springer
We propose a new, logical, approach to the decidability problem for the Straubing and Brzozowski hierarchies based on the preservation theorems from model theory, on a theorem of ...
102
click to vote
DLT
2003
15 years 1 months ago
2003
In recent years generalized acceptance criteria for different nondeterministic computation models have been examined. Instead of the common definition where an input word is said...
ACTAC
2008
15 years 22 hour ago
2008
In this paper, a characterization of the language varieties and congruence varieties corresponding to M-solid pseudovarieties is presented. Taking into account the isomorphisms of...
CORR
2006
Springer
14 years 12 months ago
2006
Springer
Typechecking consists of statically verifying whether the output of an XML transformation always conforms to an output type for documents satisfying a given input type. In this ge...
IJCGA
2006
14 years 12 months ago
2006
We obtain lower bounds in the algebraic computation tree model for deciding the separability of two disjoint point sets. In particular, we show (n log n) time lower bounds for sep...