495 search results - page 34 / 99 » Automata and differentiable words |
81
Voted
SPIRE
2005
Springer
15 years 3 months ago
2005
Springer
We present a new algorithm for generating super condensed neighbourhoods. Super condensed neighbourhoods have recently been presented as the minimal set of words that represent a p...
107
click to vote
ACL
1996
14 years 11 months ago
1996
We present a language model consisting of a collection of costed bidirectional finite state automata associated with the head words of phrases. The model is suitable for increment...
73
Voted
ENTCS
2008
14 years 10 months ago
2008
This paper describes an extension to Lustre to support the analysis of globally asynchronous, locally synchronous (GALS) architectures. This extension consists of constructs for d...
89
Voted
CONTEXT
2001
Springer
15 years 2 months ago
2001
Springer
Abstract. In order to be useful, intelligent information retrieval agents must provide their users with context-relevant information. This paper presents WordSieve, an algorithm fo...
101
click to vote
DAM
2011
14 years 5 months ago
2011
Partial words, which are sequences that may have some undefined positions called holes, can be viewed as sequences over an extended alphabet A = A ∪ { }, where stands for a hol...