Summary
In order to gain some insight into the practically undisclosed phenomenon of general Context-Sensitivity the concept of Weak-Context-Sensitivity proves to be a very useful tool.
With the correspondences WCS—recursive and Context-Sensitive—recursively enumberable a strong connection to the well known Analysis of the Unsolvable is established.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
Rogers, R., Jr.: Theory of recursive functions and effective computability. New York: McGraw-Hill 1967
Sacks, G. E.: Degrees of unsolvability. Annals of Mathematics Studies. 55. Princeton (N.J.): Princeton University Press 1963
Smullyan, R. M.: Theory of formal systems. Annals of Mathematics Studies 47. Princeton (N.J.): Princeton University Press 1961
Lewis, P.M., Stearns, R. E., Hartmanis, J.: Memory bounds for recognition of context-free and context-sensitive languages. IEEE Conference Record on Switching Circuit Theory and Logical Design, Ann. Arbor (Mich.) 1965, p. 191–202
Schuler, P.F.: Weakly-context-sensitive languages as model for programming languages. Acta Informatica 3, 155–170 (1974)
Author information
Authors and Affiliations
Rights and permissions
About this article
Cite this article
Schuler, P.F. WCS-analysis of the Context-Sensitive. Acta Informatica 4, 359–371 (1975). https://doi.org/10.1007/BF00289617
Received:
Issue Date:
DOI: https://doi.org/10.1007/BF00289617