Skip to main content
SpringerLink
Log in

Bounded monotone recursion and multihead automata

  • Published:
Programming and Computer Software Aims and scope Submit manuscript

Abstract

On the basis of bounded monotone recursion, a class BMR of word functions over the alphabet {1, 2} is defined. A new type of a computing device is introduced, which is called a multihead nonerasing automaton with output, or an MH automaton. It is proved that the class BMR coincides with the class MHA of word functions computable by MH automata in polynomial time. Numerous examples of word functions from the class BMR are given.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Log in via an institution

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Similar content being viewed by others

References

  1. Lyapunov, A.A., On logical schemes of programs, in Problemy kibernetiki (Problems of Cybernetics), Moscow: Fizmatgiz, 1958, vol. 1, pp. 46–74.

    Google Scholar 

  2. Yanov, Yu. I., On logical schemes of algorithms, in Problemy kibernetiki (Problems of Cybernetics), Moscow: Fizmatgiz, 1958, vol. 1, pp. 75–127.

    Google Scholar 

  3. Podlovchenko, R.I., Hierarchy of program models, Programmirovanie, 1981, no. 2, pp. 3–14.

    Google Scholar 

  4. Podlovchenko, R.I., Recursive programs and hierarchies of their models, Programmirovanie, 1991, no. 6, pp. 44–51.

    Google Scholar 

  5. Grzegorczyk, A., Rozprawy Matematyczne, vol. 4: Some Classes of Recursive Functions, Warsaw: Math. Inst., Polish Acad. Sci., 1953.

    Google Scholar 

  6. Marchenkov, S.S., Elementarnye rekursivnye funktsii (Elementary Recursive Functions), Moscow: MTsNMO, 2003.

    Google Scholar 

  7. Volkov, S.A., On the class of Skolem elementary functions, J. Appl. Industrial Math., 2010, vol. 4, no. 4, pp. 588–599.

    Article  Google Scholar 

  8. Volkov, S.A., An exponential extension of the class of Skolem elementary functions and bounded superpositions of simple arithmetic functions, in Matematicheskie voprosy kibernetiki (Mathematical Questions of Cybernetics), Moscow: Fizmatlit, 2007, vol. 16, pp. 163–190.

    MATH  Google Scholar 

  9. Clote, P., Sequential, machine-independent characterizations of the parallel complexity classes ALOGTIME, ACk, NCk and NC, in Feasible Mathematics Boston: Birkhäuser, 1990, pp. 49–69.

    Chapter  Google Scholar 

  10. Clote, P., Computation models and functional algebras, in Handbook of Computability Theory, Amsterdam: Elsevier, 1999, pp. 589–681.

    Chapter  Google Scholar 

  11. Mazzanti, S., CRN elimination and substitution bases for complexity classes. http://rice.iuav.it/311/1/bases18rice.pdf

  12. Kozmidiadi, V.A. and Marchenkov, S.S., On multihead automata, in Problemy kibernetiti (Problems of Cybernetics), Moscow: Nauka, 1969, vol. 21, pp. 127–158.

    Google Scholar 

  13. Marchenkov, S.S., Elimination of recursion schemas in the Grzegorczyk class, Math. Notes, 1969, vol. 5, no. 5, pp. 561–568.

    Article  Google Scholar 

  14. Smullyan, R., Theory of Formal Systems, Princeton: Princeton Univ., 1959.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Faculty of Computation Mathematics and Cybernetics, Moscow State University, Moscow, 119991, Russia

    S. S. Marchenkov

Authors
  1. S. S. Marchenkov
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to S. S. Marchenkov.

Additional information

Original Russian Text © S.S. Marchenkov, 2013, published in Programmirovanie, 2013, Vol. 39, No. 6.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Marchenkov, S.S. Bounded monotone recursion and multihead automata. Program Comput Soft 39, 301–308 (2013). https://doi.org/10.1134/S0361768813060054

Download citation

  • Received:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1134/S0361768813060054

Keywords

Search

Navigation