VoyForums
[ Show ]
Support VoyForums
[ Shrink ]
VoyForums Announcement: Programming and providing support for this service has been a labor of love since 1997. We are one of the few services online who values our users' privacy, and have never sold your information. We have even fought hard to defend your privacy in legal cases; however, we've done it with almost no financial support -- paying out of pocket to continue providing the service. Due to the issues imposed on us by advertisers, we also stopped hosting most ads on the forums many years ago. We hope you appreciate our efforts.

Show your support by donating any amount. (Note: We are still technically a for-profit company, so your contribution is not tax-deductible.) PayPal Acct: Feedback:

Donate to VoyForums (PayPal):

Login ] [ Contact Forum Admin ] [ Main index ] [ Post a new message ] [ Search | Check update time | Archives: 12 ]
Subject: Context-sensitive language


Author:
Heden
[ Next Thread | Previous Thread | Next Message | Previous Message ]
Date Posted: 06:08:32 01/22/16 Fri
Author Host/IP: NoHost/121.54.54.139

Context-sensitive language
From Wikipedia, the free encyclopedia
"Context-dependent" redirects here. For the type of memory, see Context-dependent memory.
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.

Contents [hide]
1 Computational properties
2 Examples
3 Properties of context-sensitive languages
4 See also
5 References
Computational properties[edit]
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[edit]
One of the simplest context-sensitive, but not context-free languages is L = \{ a^nb^nc^n : n \ge 1 \}: 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 = { ap : 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[edit]
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.
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.
See also[edit]
Linear bounded automaton
Chomsky hierarchy
Indexed languages – a strict subset of the context-sensitive languages
Weir hierarchy
References[edit]
Jump up ^ 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.
Jump up ^ 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.
Jump up ^ Pullum, Geoffrey K. (1983). Context-freeness and the computer processing of human languages. Proc. 21st Annual Meeting of the ACL.
Jump up ^ Bach, E. (1981). "Discontinuous constituents in generalized categorial grammars". NELS, vol. 11, pp. 1–12.
Jump up ^ 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.
Jump up ^ 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.
Jump up ^ Immerman, Neil (1988). "Nondeterministic space is closed under complementation" (PDF). SIAM J. Comput. 17 (5): 935–938. doi:10.1137/0217058.
Sipser, M. (1996), Introduction to the Theory of Computation, PWS Publishing Co.
[hide] v t e
Automata theory: formal languages and formal grammars
Chomsky hierarchy Grammars Languages Abstract machines
Type-0

Type-1





Type-2


Type-3


Unrestricted
(no common name)
Context-sensitive
Positive range concatenation
Indexed

Linear context-free rewriting systems
Tree-adjoining
Context-free
Deterministic context-free
Visibly pushdown
Regular

Non-recursive
Recursively enumerable
Decidable
Context-sensitive
Positive range concatenation*
Indexed*

Linear context-free rewriting language
Tree-adjoining
Context-free
Deterministic context-free
Visibly pushdown
Regular
Star-free
Finite
Turing machine
Decider
Linear-bounded
PTIME Turing Machine
Nested stack
Thread automaton

Embedded pushdown
Nondeterministic pushdown
Deterministic pushdown
Visibly pushdown
Finite
Counter-free (with aperiodic finite monoid)
Acyclic finite
Each category of languages, except those marked by a *, is a proper subset of the category directly above it. Any language in each category is generated by a grammar and by an automaton in the category in the same line.
Categories: Formal languages

[ Next Thread | Previous Thread | Next Message | Previous Message ]


Post a message:
This forum requires an account to post.
[ Create Account ]
[ Login ]
[ Contact Forum Admin ]


Forum timezone: GMT-8
VF Version: 3.00b, ConfDB:
Before posting please read our privacy policy.
VoyForums(tm) is a Free Service from Voyager Info-Systems.
Copyright © 1998-2019 Voyager Info-Systems. All Rights Reserved.