This is a preview of subscription content, log in via an institution to check access.
Preview
Unable to display preview. Download preview PDF.
References
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).
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.
Ibarra, O. H., A hierarchy theorem for polynomial-spase recognition. SIAM J. Comput., 3 (1974) 184–187.
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.
Rabin, M. O., Real time computation. Israel J. Math., 1 (1963) 203–211.
Freivald, R. V., Complexity of palindrome recognition by Turing machines with input. Algebra and Logic, 4 (1965) 47–58 (Russian).
Valiev, M. K., On time complexity of Turing machines with restrictions on tape alphabet. V All-Union Symp. on Cybernetics, Tbilisi, 1970 (Russian).
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1977 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Valiev, M.K. (1977). Real time computations with restrictions on tape alphabet. In: Gruska, J. (eds) Mathematical Foundations of Computer Science 1977. MFCS 1977. Lecture Notes in Computer Science, vol 53. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-08353-7_176
Download citation
DOI: https://doi.org/10.1007/3-540-08353-7_176
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-08353-5
Online ISBN: 978-3-540-37285-1
eBook Packages: Springer Book Archive