Context-sensitive language (English Wikipedia)

Analysis of information sources in references of the Wikipedia article "Context-sensitive language" in English language version.

refsWebsite

Global rank English rank

2^nd place

2^nd place

451^st place

277^th place

2web.archive.org

1^st place

1^st place

3,341^st place

2,191^st place

low place

6,793^rd place

332^nd place

246^th place

102^nd place

76^th place

1semanticscholar.org

11^th place

8^th place

6^th place

6^th place

207^th place

136^th place

aclweb.org (Global: low place; English: 6,793^rd place)

Pullum, Geoffrey K. (1983). Context-freeness and the computer processing of human languages. Proc. 21st Annual Meeting of the ACL.

ams.org (Global: 451^st place; English: 277^th place)

mathscinet.ams.org

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, vol. 143, Amsterdam: North-Holland Publishing Co., p. 236, ISBN 978-0-444-50205-6, MR 1718169.

archive.org (Global: 6^th place; English: 6^th place)

John E. Hopcroft; Jeffrey D. Ullman (1979). Introduction to Automata Theory, Languages, and Computation. Addison-Wesley. ISBN 9780201029888.; Exercise 9.10, p.230. In the 2000 edition, the chapter on context-sensitive languages has been omitted.

cornell.edu (Global: 332^nd place; English: 246^th place)

ecommons.cornell.edu

J. Hartmanis and H. Shank (Jul 1968). "On the Recognition of Primes by Automata" (PDF). Journal of the ACM. 15 (3): 382–389. doi:10.1145/321466.321470. hdl:1813/5864. S2CID 17998039.

doi.org (Global: 2^nd place; English: 2^nd place)

J. Hartmanis and H. Shank (Jul 1968). "On the Recognition of Primes by Automata" (PDF). Journal of the ACM. 15 (3): 382–389. doi:10.1145/321466.321470. hdl:1813/5864. S2CID 17998039.
Salomaa, Arto (1969), Theory of Automata, ISBN 978-0-08-013376-8, Pergamon, 276 pages. doi:10.1016/C2013-0-02221-9
Immerman, Neil (1988). "Nondeterministic space is closed under complementation" (PDF). SIAM J. Comput. 17 (5): 935–938. CiteSeerX 10.1.1.54.5941. doi:10.1137/0217058. Archived (PDF) from the original on 2004-06-25.

handle.net (Global: 102^nd place; English: 76^th place)

hdl.handle.net

J. Hartmanis and H. Shank (Jul 1968). "On the Recognition of Primes by Automata" (PDF). Journal of the ACM. 15 (3): 382–389. doi:10.1145/321466.321470. hdl:1813/5864. S2CID 17998039.

psu.edu (Global: 207^th place; English: 136^th place)

citeseerx.ist.psu.edu

Immerman, Neil (1988). "Nondeterministic space is closed under complementation" (PDF). SIAM J. Comput. 17 (5): 935–938. CiteSeerX 10.1.1.54.5941. doi:10.1137/0217058. Archived (PDF) from the original on 2004-06-25.

semanticscholar.org (Global: 11^th place; English: 8^th place)

api.semanticscholar.org

J. Hartmanis and H. Shank (Jul 1968). "On the Recognition of Primes by Automata" (PDF). Journal of the ACM. 15 (3): 382–389. doi:10.1145/321466.321470. hdl:1813/5864. S2CID 17998039.

umass.edu (Global: 3,341^st place; English: 2,191^st place)

people.umass.edu

Bach, E. (1981). "Discontinuous constituents in generalized categorial grammars" Archived 2014-01-21 at the Wayback Machine. NELS, vol. 11, pp. 1–12.

cs.umass.edu

Immerman, Neil (1988). "Nondeterministic space is closed under complementation" (PDF). SIAM J. Comput. 17 (5): 935–938. CiteSeerX 10.1.1.54.5941. doi:10.1137/0217058. Archived (PDF) from the original on 2004-06-25.

web.archive.org (Global: 1^st place; English: 1^st place)

Bach, E. (1981). "Discontinuous constituents in generalized categorial grammars" Archived 2014-01-21 at the Wayback Machine. NELS, vol. 11, pp. 1–12.
Immerman, Neil (1988). "Nondeterministic space is closed under complementation" (PDF). SIAM J. Comput. 17 (5): 935–938. CiteSeerX 10.1.1.54.5941. doi:10.1137/0217058. Archived (PDF) from the original on 2004-06-25.