1052 search results - page 170 / 211 » The Regular Real-Time Languages |
126
click to vote
IFIP
2004
Springer
15 years 8 months ago
2004
Springer
Abstract In this paper we introduce the Weighted Suffix Tree, an efficient data structure for computing string regularities in weighted sequences of molecular data. Molecular Wei...
124
Voted
ICDT
2003
ACM
15 years 8 months ago
2003
ACM
We define a boolean complete description logic dialect called DLFDreg that can be used to reason about structural equality in semistructured ordered data in the presence of docume...
126
Voted
SAS
1999
Springer
15 years 7 months ago
1999
Springer
ing Cryptographic Protocols with Tree Automata David Monniaux http://www.di.ens.fr/%7Fmonniaux, Laboratoire d’Informatique, ´Ecole Normale Sup´erieure, 45 rue d’Ulm , 75230 P...
125
Voted
AMAST
1998
Springer
15 years 7 months ago
1998
Springer
Abstract. This paper proposes a tool to support reasoning about (partial) correctness of constraint logic programs. The tool infers a speci cation that approximates the semantics o...
107
Voted
EP
1998
Springer
15 years 7 months ago
1998
Springer
Abstract. In 1945, the Cairo Academy for the Arabic Language opened a contest to find the best project for simplification of the Arabic writing system. They received about 200 repl...