Home On elementary word functions obtained by bounded prefix concatenation
Article
Licensed
Unlicensed Requires Authentication

On elementary word functions obtained by bounded prefix concatenation

  • Sergey S. Marchenkov EMAIL logo
Published/Copyright: July 15, 2016
Become an author with De Gruyter Brill
Author Information Explore this Subject
Discrete Mathematics and Applications
From the journal Discrete Mathematics and Applications Volume 26 Issue 3

Abstract

The operation of bounded prefix concatenation (BPC) is introduced on the set of word functions in the alphabet {1, 2}. The class BPC of polynomially computable functions is defined on the basis of this operation and the superposition operation. The class BPC is shown to contain a number of word functions and to be closed with respect to certain known operations. A certain type of two-tape nonerasing Turing machines is introduced, functions from the class BPC are shown to be computable on machines of this type in polynomial time.

Keywords: bounded prefix concatenation; polynomially computable function

Funding: This research was carried out with the financial support of the Russian Foundation for Basic Research (grant no. 13-01-00958).

Note: Originally published in Diskretnaya Matematika (2015) 27, No_3, 44–55 (in Russian).

References

[1] Kuznetsov A. V., “On a theorem on the canonical form for ordinal recursive functions”, Supplement to: R. L. Goodstein, Mathematical logic, Inostrannaya Literatura, 1961, 149–154 (in Russian).Search in Google Scholar

[2] Marchenkov S. S., Elementary recursive functions, MCCME, Moscow, 2003 (in Russian), 112 pp.Search in Google Scholar

[3] Marchenkov S. S., “Limited monotonous recursion and MG-automata”, Programming, 2013, No_6, 3–11 (in Russian).Search in Google Scholar

[4] Grzegorczyk, A., “Some classes of recursive functions”, Rozpr. Matemat., 4 (1962), 1–46.Search in Google Scholar

[5] Kalmar, L., “Egyszerü pelda eldonthetelen aritmetikai problemara”, Mat. és fiz. lapok, 50 (1943), 1–23.Search in Google Scholar

[6] Skolem, Th., “Proof of some theorems on recursively enumerable sets”, Notre Dame J. Formal Logic, 3:2 (1962), 65–74.10.1305/ndjfl/1093957149Search in Google Scholar

Received: 2015-4-14
Published Online: 2016-7-15
Published in Print: 2016-7-1

© 2016 Walter de Gruyter GmbH, Berlin/Boston

Articles in the same Issue

  1. Research Article
  2. Finite automata and numbers
  3. Research Article
  4. On coincidences of tuples in a binary tree with random labels of vertices
  5. Research Article
  6. On elementary word functions obtained by bounded prefix concatenation
  7. Research Article
  8. Functions without short implicents. Part II: Construction
  9. Research Article
  10. Images of a finite set under iterations of two random dependent mappings
  11. Research Article
  12. Extinction of decomposable branching processes
https://doi.org/10.1515/dma-2016-0013
Keywords for this article
bounded prefix concatenation; polynomially computable function

Articles in the same Issue

  1. Research Article
  2. Finite automata and numbers
  3. Research Article
  4. On coincidences of tuples in a binary tree with random labels of vertices
  5. Research Article
  6. On elementary word functions obtained by bounded prefix concatenation
  7. Research Article
  8. Functions without short implicents. Part II: Construction
  9. Research Article
  10. Images of a finite set under iterations of two random dependent mappings
  11. Research Article
  12. Extinction of decomposable branching processes
Sign up now to receive a 20% welcome discount
Institutional Access
How does access work?
Have an idea on how to improve our website?
Please write us.
© 2025 De Gruyter Brill
Downloaded on 30.11.2025 from https://www.degruyterbrill.com/document/doi/10.1515/dma-2016-0013/pdf?lang=en
Scroll to top button