The present paper proposes a generalisation of the notion of disjunctive (or rich) sequence, that is, of an infinite sequence of letters having each finite sequence as a subword. Our aim is to give a reasonable notion of disjunc-tiveness relative to a given set of sequences F. We show that a definition like " every subword which occurs at infinitely many different positions in sequences in F ha...

Using arch-jumping functions and properties of the arch factorization words, we propose a new algorithm for computing subword circular universality index words. We also introduce signature that leads to simple algorithms indexes SLP-compressed

PLX is a small, fully subword-parallel instruction set architecture designed for very fast multimedia processing, especially in constrained environments requiring low cost and power such as handheld multimedia information appliances. In PLX, we select the most useful multimedia instructions added previously to microprocessors. We also introduce a few novel features: a new definition of predicat...

In this paper we investigate the fusion of different information sources with the goal of improving performance on spoken document retrieval (SDR) tasks. In particular, we explore the use of multiple transcriptions from different automatic speech recognizers, the combination of different types of subword unit indexing terms, and the combination of word and subword-based units. To perform retrie...

The neighbourhood of a regular language with respect to the prefix, suffix and subword distance is always regular and a tight bound for the state complexity of prefix distance neighbourhoods is known. We give upper bounds for the state complexity of the neighbourhood of radius k of an n state DFA (deterministic finite automaton) language with respect to the suffix distance and the subword dista...

Let N be the set of all positive integers and let A be any ordered subset of N. Recently, Heubach and Mansour enumerated the number of compositions of nwithm parts inA that contain the subword τ exactly r times, where τ ∈ {111, 112, 221, 123}. Our aims are (1) to generalize the above results, i.e., to enumerate the number of compositions of n with m parts in A that contain an `-letter subword, ...

The present paper proposes a generalisation of the notion of disjunctive (or rich) sequence, that is, of an infinite sequence of letters having each finite sequence as a subword. Our aim is to give a reasonable notion of disjunctiveness relative to a given set of sequences F . We show that a definition like “every subword which occurs at infinitely many different positions in sequences in F has...

In this paper we use whole word and subword hidden Markov models for text dependent speaker veri cation. In this application usually only a small amount of training data is available for each model. In order to cope with this limitation we propose a intermediate functional representation of the training data allowing the robust initialization of the models. This new approach is tested with two ...