Indexed language (English Wikipedia)

Analysis of information sources in references of the Wikipedia article "Indexed language" in English language version.

refsWebsite

Global rank English rank

8doi.org

2^nd place

3semanticscholar.org

11^th place

8^th place

2books.google.com

3^rd place

1proquest.com

206^th place

124^th place

1arxiv.org

69^th place

59^th place

1archive.org

6^th place

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

Hopcroft, John; Ullman, Jeffrey (1979). Introduction to automata theory, languages, and computation. Addison-Wesley. p. 390. ISBN 978-0-201-02988-8.

arxiv.org (Global: 69^th place; English: 59^th place)

Gilman, Robert H. (1996). "A Shrinking Lemma for Indexed Languages". Theoretical Computer Science. 163 (1–2): 277–281. arXiv:math/9509205. doi:10.1016/0304-3975(96)00244-7. S2CID 14479068.

books.google.com (Global: 3^rd place; English: 3^rd place)

Kallmeyer, Laura (2010). Parsing Beyond Context-Free Grammars. Springer. p. 31. ISBN 978-3-642-14846-0.
Kallmeyer, Laura (16 August 2010). Parsing Beyond Context-Free Grammars. Springer. p. 32. ISBN 978-3-642-14846-0.

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

Aho, Alfred (1968). "Indexed grammars—an extension of context-free grammars". Journal of the ACM. 15 (4): 647–671. doi:10.1145/321479.321488. S2CID 9539666.
Gazdar, Gerald (1988). "Applicability of Indexed Grammars to Natural Languages". In Reyle, U.; Rohrer, C. (eds.). Natural Language Parsing and Linguistic Theories. Studies in Linguistics and Philosophy. Vol. 35. Springer Netherlands. pp. 69–94. doi:10.1007/978-94-009-1337-0_3. ISBN 978-94-009-1337-0.
Gilman, Robert H. (1996). "A Shrinking Lemma for Indexed Languages". Theoretical Computer Science. 163 (1–2): 277–281. arXiv:math/9509205. doi:10.1016/0304-3975(96)00244-7. S2CID 14479068.
Aho, Alfred V. (July 1969). "Nested Stack Automata". Journal of the ACM. 16 (3): 383–406. doi:10.1145/321526.321529. S2CID 685569.
Fischer, Michael J. (October 1968). "Grammars with macro-like productions". 9th Annual Symposium on Switching and Automata Theory (Swat 1968). pp. 131–142. doi:10.1109/SWAT.1968.12.
Greibach, Sheila A. (March 1970). "Full AFLs and nested iterated substitution". Information and Control. 16 (1): 7–35. doi:10.1016/s0019-9958(70)80039-0.
Maibaum, T.S.E. (June 1974). "A generalized approach to formal languages". Journal of Computer and System Sciences. 8 (3): 409–439. doi:10.1016/s0022-0000(74)80031-0.
Hayashi, Takeshi (1973). "On derivation trees of indexed grammars: an extension of the {$uvwxy$}-theorem". Publications of the Research Institute for Mathematical Sciences. 9 (1): 61–92. doi:10.2977/prims/1195192738.

proquest.com (Global: 206^th place; English: 124^th place)

Vijayashanker, K. (1987). A study of tree adjoining grammars (Thesis). ProQuest 303610666.

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

api.semanticscholar.org

Aho, Alfred (1968). "Indexed grammars—an extension of context-free grammars". Journal of the ACM. 15 (4): 647–671. doi:10.1145/321479.321488. S2CID 9539666.
Gilman, Robert H. (1996). "A Shrinking Lemma for Indexed Languages". Theoretical Computer Science. 163 (1–2): 277–281. arXiv:math/9509205. doi:10.1016/0304-3975(96)00244-7. S2CID 14479068.
Aho, Alfred V. (July 1969). "Nested Stack Automata". Journal of the ACM. 16 (3): 383–406. doi:10.1145/321526.321529. S2CID 685569.

Indexed language (English Wikipedia)

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

arxiv.org (Global: 69th place; English: 59th place)

books.google.com (Global: 3rd place; English: 3rd place)

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

proquest.com (Global: 206th place; English: 124th place)

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