문맥 의존 언어 (Korean Wikipedia)

Analysis of information sources in references of the Wikipedia article "문맥 의존 언어" in Korean language version.

refsWebsite

Global rank Korean rank

2^nd place

3^rd place

451^st place

121^st place

3,341^st place

3,671^st place

low place

1^st place

332^nd place

338^th place

6^th place

18^th place

207^th place

220^th place

aclweb.org

Rothe, Jörg (2005), 《Complexity theory and cryptology》, Texts in Theoretical Computer Science. An EATCS Series, Berlin: Springer-Verlag, 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., 236쪽, ISBN 978-0-444-50205-6, MR 1718169 .

John E. Hopcroft; Jeffrey D. Ullman (1979). 《Introduction to Automata Theory, Languages, and Computation》. Addison-Wesley. ; Exercise 9.10, p.230. 2000년판에는 문맥 의존 언어에 관한 장이 빠졌다.

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.

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.
Salomaa, Arto (1969), Theory of Automata, ISBN 978-0-08-013376-8, Pergamon, 276 pages. doi:10.1016/C2013-0-02221-9 (pages 213-214, exercise 6.8)
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.