Sciweavers

495 search results - page 34 / 99
» Automata and differentiable words
Sort
View
SPIRE
2005
Springer
14 years 1 months ago
Faster Generation of Super Condensed Neighbourhoods Using Finite Automata
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...
Luís M. S. Russo, Arlindo L. Oliveira
ACL
1996
13 years 9 months ago
Head Automata and Bilingual Tiling: Translation with Minimal Representations
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...
Hiyan Alshawi
ENTCS
2008
125views more  ENTCS 2008»
13 years 7 months ago
Extending Lustre with Timeout Automata
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...
Jimin Gao, Mike Whalen, Eric Van Wyk
CONTEXT
2001
Springer
14 years 9 days ago
WordSieve: A Method for Real-Time Context Extraction
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...
Travis Bauer, David B. Leake
DAM
2011
13 years 2 months ago
On minimal Sturmian partial words
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...
Francine Blanchet-Sadri, John Lensmire