Skip to search formSkip to main contentSkip to account menu

Recurrent word

Known as: Minimal word, Uniformly recurrent word 
In mathematics, a recurrent word or sequence is an infinite word over a finite alphabet in which every factor occurs infinitely often. An infinite… 
Wikipedia (opens in a new tab)

Related topics

Related topics

3 relations
Complexity functionSesquipowerThue–Morse sequence

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
2014
2014
El transfondo ocultista del cuervo: desde su simbolismo poético a los "topoi" modernistas
The anthropological and religious interest for the raven is present in Buddhism, in biblical stories, in North and Greek… 
2014
2014
Morphological Markedness in an OT-Grammar: zeros and syncretism
In this paper, I propose to extend a model of grammar in which lexical spellout and phonological computation occur in the same… 
2012
2012
Prosodic Inconsistency in Tohono O’odham 1
This paper makes a typological contribution by describing a stress system that uses syllabic trochees while also displaying… 
2011
2011
On uniform recurrence of HD0l systems
We prove that the problem of deciding whether a given morphic sequence is uniformly recurrent is decidable. The proof uses… 
2010
2010
Low-cost variable-length FFT processor for DVB-T/H applications
This paper presents a low-cost variable-length FFT processor for digital video broadcasting - terrestrial / handheld (DVB-T/H… 
2007
2007
Character N-Grams Translation in Cross-Language Information Retrieval
This paper describes a new technique for the direct translation of character n-grams for use in Cross-Language Information… 
Review
2003
Review
2003
SYMBOLIC DYNAMICS IN FREE PROFINITE SEMIGROUPS
This is a survey and announcement of recent results on the structure of free profinite semigroups using techniques and results… 
2000
2000
Towards a Strategy for a Representation of Collocations - Extending the Danish PAROLE-lexicon
We describe our attempts to formulate a pragmatic definition and a partial typology of the lexical category of ’collocation… 
1998
1998
On Minimal Words With Given Subword Complexity
We prove that the minimal length of a word $S_n$ having the property that it contains exactly $F_{m+2}$ distinct subwords of… 
1988
1988
Lexical stress recognition using hidden Markov models
A probabilistic algorithm is described for the estimation of the lexical stress pattern of English words from the acoustic signal… 
By clicking accept or continuing to use the site, you agree to the terms outlined in our Privacy Policy (opens in a new tab), Terms of Service (opens in a new tab), and Dataset License (opens in a new tab)