Real time computations with restrictions on tape alphabet

  • M. K. Valiev
Part of the Lecture Notes in Computer Science book series (LNCS, volume 53)


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. 1.
    Matveeva, S. G. and Valiev, M. K., Some bounds of computational complexity for Turing machines. Intern. Congr. of Math., Abstracts, Section 13, Moscow, 1966. (Russian).Google Scholar
  2. 2.
    Seiferas, J. I., Fischer, M. J. and Meyer, A. R., Refinements of the hierarchies of time and tape complexities. 14th Annual Symp. on Switch. and Automata Theory, Iowa City, Iowa, 1973.Google Scholar
  3. 3.
    Ibarra, O. H., A hierarchy theorem for polynomial-spase recognition. SIAM J. Comput., 3 (1974) 184–187.CrossRefGoogle Scholar
  4. 4.
    Ibarra, O. H. and Sahni, S. K., Hierarchies of Turing machines with restricted tape alphabet size. J. Comp. and Syst. Sci., 11 (1975) 56–67.Google Scholar
  5. 5.
    Rabin, M. O., Real time computation. Israel J. Math., 1 (1963) 203–211.Google Scholar
  6. 6.
    Freivald, R. V., Complexity of palindrome recognition by Turing machines with input. Algebra and Logic, 4 (1965) 47–58 (Russian).Google Scholar
  7. 7.
    Valiev, M. K., On time complexity of Turing machines with restrictions on tape alphabet. V All-Union Symp. on Cybernetics, Tbilisi, 1970 (Russian).Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 1977

Authors and Affiliations

  • M. K. Valiev
    • 1
  1. 1.Institute of MathematicsNovosibirsk 90USSR

Personalised recommendations