文脈依存的な、状況依存的な

WordNet

relying on or requiring a person or thing for support, supply, or what is needed; "dependent children"; "dependent on moisture"
addicted to a drug (同)dependant, drug-addicted, hooked, strung-out
contingent on something else (同)dependant, qualified
(of a clause) unable to stand alone syntactically as a complete sentence; "a subordinate (or dependent) clause functions as a noun or adjective or adverb within a sentence" (同)subordinate
the set of facts or circumstances that surround a situation or event; "the historical context" (同)circumstance, setting
discourse that surrounds a language unit and helps to determine its interpretation (同)linguistic context, context of use

PrepTutorEJDIC

『頼っている』,依存している,従属している / 扶養される人(家族)
〈C〉(文章の)前後関係,文脈 / 〈U〉(事の)周囲の情況,背景

Wikipedia preview

出典(authority):フリー百科事典『ウィキペディア（Wikipedia）』「2015/11/22 01:55:35」(JST)

wiki en

In theoretical computer science, a context-sensitive language is a formal language that can be defined by a context-sensitive grammar (and equivalently by a noncontracting grammar). That is one of the four types of grammars in the Chomsky hierarchy.

Computational properties

Computationally, a context-sensitive language is equivalent with a linear bounded nondeterministic Turing machine, also called a linear bounded automaton. That is a non-deterministic Turing machine with a tape of only kn cells, where n is the size of the input and k is a constant associated with the machine. This means that every formal language that can be decided by such a machine is a context-sensitive language, and every context-sensitive language can be decided by such a machine.

This set of languages is also known as NLINSPACE or NSPACE(O(n)), because they can be accepted using linear space on a non-deterministic Turing machine.^[1] The class LINSPACE (or DSPACE(O(n))) is defined the same, except using a deterministic Turing machine. Clearly LINSPACE is a subset of NLINSPACE, but it is not known whether LINSPACE=NLINSPACE.^[2]

Examples

One of the simplest context-sensitive, but not context-free languages is : the language of all strings consisting of n occurrences of the symbol "a", then n "b"'s, then n "c"'s (abc, aabbcc, aaabbbccc, etc.). A superset of this language, called the Bach language,^[3] is defined as the set of all strings where "a", "b" and "c" (or any other set of three symbols) occurs equally often (aabccb, baabcaccb, etc.) and is also context-sensitive.^[4]^[5]

Another example of a context-sensitive language that is not context-free is L = { a^p : p is a prime number }. L can be shown to be a context-sensitive language by constructing a linear bounded automaton which accepts L. The language can easily be shown to be neither regular nor context free by applying the respective pumping lemmas for each of the language classes to L.

An example of recursive language that is not context-sensitive is any recursive language whose decision is an EXPSPACE-hard problem, say, the set of pairs of equivalent regular expressions with exponentiation.

Properties of context-sensitive languages

The union, intersection, concatenation of two context-sensitive languages is context-sensitive; the Kleene plus of a context-sensitive language is context-sensitive.^[6]
The complement of a context-sensitive language is itself context-sensitive^[7] a result known as the Immerman–Szelepcsényi theorem.
Every context-free language not containing the empty string is context-sensitive.^[8]
Membership of a string in a language defined by an arbitrary context-sensitive grammar, or by an arbitrary deterministic context-sensitive grammar, is a PSPACE-complete problem.

References

^ Rothe, Jörg (2005), Complexity theory and cryptology, Texts in Theoretical Computer Science. An EATCS Series, Berlin: Springer-Verlag, p. 77, ISBN 978-3-540-22147-0, MR 2164257 .
^ Odifreddi, P. G. (1999), Classical recursion theory. Vol. II, Studies in Logic and the Foundations of Mathematics 143, Amsterdam: North-Holland Publishing Co., p. 236, ISBN 0-444-50205-X, MR 1718169 .
^ Pullum, Geoffrey K. (1983). Context-freeness and the computer processing of human languages. Proc. 21st Annual Meeting of the ACL.
^ 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.
^ John E. Hopcroft, Jeffrey D. Ullman (1979). Introduction to Automata Theory, Languages, and Computation. Addison-Wesley. ; Exercise 9.10, p.230. In the 2003 edition, the chapter on context-sensitive languages has been omitted.
^ Immerman, Neil (1988). "Nondeterministic space is closed under complementation" (PDF). SIAM J. Comput. 17 (5): 935–938. doi:10.1137/0217058.
^ (Hopcroft, Ullman, 1979); Theorem 9.9 b, p.228

Sipser, M. (1996), Introduction to the Theory of Computation, PWS Publishing Co.

UpToDate Contents

全文を閲覧するには購読必要です。 To read the full text you will need to subscribe.

1. ビタミンＫとγカルボキシグルタミン酸の合成および機能 vitamin k and the synthesis and function of gamma carboxyglutamic acid
2. 黒色腫（メラノーマ）に対する遺伝的感受性 inherited susceptibility to melanoma
3. パーソナリティ障害患者との治療関係へのアプローチ approaches to the therapeutic relationship in patients with personality disorders
4. 稀な遺伝性凝固異常 rare inherited coagulation disorders
5. 体液性免疫応答 the humoral immune response

English Journal

Gene Regulation of Prominin-1 (CD133) in Normal and Cancerous Tissues.

Tabu K, Bizen N, Taga T, Tanaka S.SourceDepartment of Stem cell Regulation, Medical Research Institute, Tokyo Medical and Dental University, 1-5-45, Yushima, Bunkyo-ku, 113-8510, Tokyo, Japan, k-tabu.scr@mri.tmd.ac.jp.
Advances in experimental medicine and biology.Adv Exp Med Biol.2013;777:73-85. doi: 10.1007/978-1-4614-5894-4_5.
A pentaspan membrane glycoprotein prominin-1 (frequently called CD133 in human) is widely used as a surface marker to identify and isolate normal stem/progenitor cells from various organs, although it is also expressed in some types of differentiated cells. Since CD133 was identified as a universal
PMID 23161076

Using Caenorhabditis to explore the evolution of the germ line.

Haag ES, Liu Q.SourceDepartment of Biology, University of Maryland, College Park, MD 20742, USA. ehaag@umd.edu
Advances in experimental medicine and biology.Adv Exp Med Biol.2013;757:405-25. doi: 10.1007/978-1-4614-4015-4_14.
Germ cells share core attributes and homologous molecular components across animal phyla. Nevertheless, abrupt shifts in reproductive mode often occur that are mediated by the rapid evolution of germ cell properties. Studies of Caenorhabditis nematodes show how the otherwise conserved RNA-binding pr
PMID 22872485

Japanese Journal

Context-dependent olfactory learning monitored by activities of salivary neurons in cockroaches

Sato Matsumoto Chihiro,Matsumoto Yukihisa,Watanabe Hidehiro,Nishino Hiroshi,Mizunami Makoto
Neurobiology of Learning and Memory 97(1), 30-36, 2012-01
… Context-dependent discrimination learning, a sophisticated form of nonelemental associative learning, has been found in many animals, including insects. … We report context-dependent olfactory learning (occasion-setting problem solving) of salivation, which can be monitored as activity changes of salivary neurons in immobilized cockroaches, Periplaneta americana. …
NAID 120003762641