- Bach language
In theoretical
computer science , the Bach language is theformal language over analphabet of three distinct symbols containing all strings in which the three symbols occur equally often. The Bach language is acontext-sensitive language .Pullum (1983) called this the "Bach language", because it was first discussed in Bach (1981).
References
*Bach, E. (1981). "Discontinuous constituents in generalized categorial grammars". "NELS", vol. 11, pp. 1–12.
*Joshi, A.; Vijay-Shanker, K.; and Weir, D. (1991). "The convergence of mildly context-sensitive grammar formalisms". In: SELLS, P., Shieber, S.M. and Wasow, T. (Editors). "Foundational Issues in Natural Language Processing". Cambridge MA: Bradford.
*Pullum, Geoffrey K. (1983). "Context-freeness and the computer processing of human languages". In: "Proceedings of the 21st Annual Meeting of the Association for Computational Linguistics", 15–17 June 1983, Cambridge, MA.
Wikimedia Foundation. 2010.