On the operations of bounded suffix summation and multiplication


Cite item

Full Text

Open Access Open Access
Restricted Access Access granted
Restricted Access Subscription Access

Abstract

The operations of bounded suffix summation and bounded suffix multiplication are introduced. Using these operations, we define the class BSSM of polynomially computable functions. It is proved that the class BSSMcontains the class BPC defined by the operation of bounded prefix concatenation and has finite basis under superposition.

About the authors

S. S. Marchenkov

Lomonosov Moscow State University

Author for correspondence.
Email: ssmarchen@yandex.ru
Russian Federation, Leninskie gory 1, Moscow, 119991

Supplementary files

Supplementary Files
Action
1. JATS XML

Copyright (c) 2017 Pleiades Publishing, Ltd.