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.
2017
2017
Using noise to speed up video classification with recurrent backpropagation
Carefully injected noise can speed the convergence and accuracy of video classification with recurrent backpropagation (RBP… 
Review
2017
Review
2017
Profinite semigroups
We present a survey of results on profinite semigroups and their link with symbolic dynamics. We develop a series of results… 
2015
2015
Correlates of Chinese neutral tone perception in different contexts
A psychoacoustic experiment was conducted to investigate correlates of neutral tone perception and the distribution of the… 
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… 
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… 
2010
2010
Prosodic fusion and minimality in Kabardian*
Abstract The Northwest Caucasian language Kabardian displays a typologically unusual process of word formation, whereby two… 
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… 
1997
1997
Learning recursive data is intractable
We establish some general results concerning PAC learning: We nd a characterization of the property, that any consistent… 
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)