scientific article; zbMATH DE number 3943055

From MaRDI portal
Publication:3714481





[For the entire collection see Zbl 0575.00023.] Several kinds of repetitiveness can be associated with languages. In this paper, a type of repetitiveness that occurs naturally in DOL schemes and that is related to the embedding order is considered. Let \(D=(X,h)\) be a DOL scheme and let \(\leq\) be the embedding order. A word \(u\in X^*\) is said to be n-recurrent, n a positive integer, if \(u\leq h^ n(u)\); n is called a recurrent exponent of u. A word u is said to be recurrent it it is n-recurrent for some \(n>0\). General properties of recurrent words and recurrent exponents are established. A DOL scheme such that every word is recurrent is called a recurrent DOL scheme. A special function can be associated with all the recurrent DOl schemes having an alphabet of a given cardinality and several inequalities satisfied by such a function are investigated.











This page was built for publication:

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3714481)