We consider avoiding squares and overlaps over the natural numbers, using a greedy algorithm that chooses the least possible integer at each step; the word generated is lexicographically least among all such infinite words. In the case of avoiding squares, the word is 01020103 · · · , the familiar ruler function, and is generated by iterating a uniform morphism. The case of overlaps is more cha...

In cognitive theory it is hypothesized that panic attacks are provoked by catastrophic misinterpretations of bodily sensations. The aim of the present study was to investigate the ability of associated word pairs referring to catastrophic thinking (e.g. palpitations-heart attack) in producing panic attacks. Patients with PD (n = 20), patients with mixed anxiety disorders (n = 20), and a healthy...

The border correlation function β : A → A, for A = {a, b}, specifies which conjugates (cyclic shifts) of a given word w of length n are bordered, i.e., β(w) = b0b1 . . . bn−1, where bi = a or b according to whether the i-th cyclic shift σ(w) of w is unbordered or bordered. Except for some special cases, no binary word w has two consecutive unbordered conjugates (σ(w) and σ(w)). We show that thi...

Middle-aged (N = 252, M = 39.91), young-old (N = 486, M = 60.77), and old-old (N = 137, M = 74.42) participants in the Seattle Longitudinal Study were tested on two occasions on their recall of a 20-item word list. Proportions of participants in each group correctly recalling each word-unit served as the dependent measure. Word-unit scores obtained in 1991 were regressed on those from 1984, yie...

I. WORD STRING DISTRIBUTION SIMULATION The aim of this description is to provide a framework for simulating specific word string distributions whose general structure follows the structure of word string posterior distributions relevant for string recognition. For the specific case of string classes w 1 = w1, w2, . . . , wN of fixed length N with words wn ∈ V , with vocabulary size V = |V|, and...

Sikkel, K., Parallel on-line parsing in constant time per word, Theoretical Computer Science 120 (1993) 303-310. An on-line parser processes each word as soon as it is typed by the user, without waiting for the end of the sentence. Thus, in an interactive system, a sentence will be parsed almost immediately after the last word has been presented. The complexity of an on-line parser is determine...

Participants' eye movements were tracked when reading sentences in which target word predictability was manipulated to being unpredictable from the preceding context, predictable from the sentence preceding the one in which the target word was embedded, or predictable from the adjective directly preceding the target word. Results show that there was no difference in skipping rates between the 2...

We propose an interface for a name input based on speech recognition using syllable-based N-gram and a word dictionary. Name utterance is hard to recognize accurately because of the large vocabulary size, so the system uses continuous syllable recognition with syllable-based N-gram and isolated word recognition with a dictionary containing frequent words. User first utters a name and then choos...

A word w over a finite alphabet Σ is n-collapsing if for an arbitrary deterministic finite automaton A = 〈Q,Σ, δ〉, the inequality |δ(Q,w)| ≤ |Q| − n holds provided that |δ(Q, u)| ≤ |Q| − n for some word u ∈ Σ (depending on A ). We prove that the the property of being n-collapsing is algorithmically recognizable for any given positive integer n. We also prove that the language of all n-collapsin...

The paper approaches the classical combinatorial problem of freeness of words, in the more general case of partial words. First, we propose an algorithm that tests efficiently whether a partial word is kfree or not. Then, we show that there exist arbitrarily many cube-free infinite partial words containing an infinite number of holes, over binary alphabets; thus, there exist arbitrarily many k-...