2002

Related Posts

Maximal complexity of finite words

Abstract The subword complexity of a finite \(\omega\) of length \(N\) is a function which associates to each \(n\leq N\)…

Finite words with special complexity properties

Abstract AuthorsMira-Cristiana Anisiu Tiberiu Popoviciu Institute of Numerical Analysis Cluj-Napoca, Romanian Academy Keywords? Paper coordinatesM.-C. Anisiu, Finite words with special…

Stancu modified operators revisited

Abstract In this paper we construct a general positive approximation process representing an integral form in Kantorovich sense of the…