Indexed grammar (English Wikipedia)

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

refsWebsite

Global rank English rank

2^nd place

11^th place

8^th place

69^th place

59^th place

low place

low place

702^nd place

520^th place

207^th place

136^th place

3^rd place

aclanthology.org

Staudacher, Peter (1993), "New frontiers beyond context-freeness: DI-grammars (DIGs) and DI-automata." (PDF), Sixth Conference of the European Chapter of the Association for Computational Linguistics (EACL '93), pp. 358–367

Robert H. Gilman (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.
Robert H. Gilman (Sep 1995). "A Shrinking Lemma for Indexed Languages". arXiv:math/9509205.

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.
Hayashi, Takeshi (1973). "On derivation trees of indexed grammars: An extension of the uvwxy-theorem". Publications of the Research Institute for Mathematical Sciences. 9: 61–92. doi:10.2977/prims/1195192738.
Alfred Aho (1969). "Nested Stack Automata". Journal of the ACM. 16 (3): 383–406. doi:10.1145/321526.321529. S2CID 685569.
Michael J. Fischer (1968). "Grammars with Macro-Like Productions". Proc. 9th Ann. IEEE Symp. on Switching and Automata Theory (SWAT). pp. 131–142. doi:10.1109/SWAT.1968.12.
Sheila A. Greibach (1970). "Full AFL's and Nested Iterated Substitution". Information and Control. 16 (1): 7–35. doi:10.1016/s0019-9958(70)80039-0.
T.S.E. Maibaum (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.
Robert H. Gilman (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.
Vijay-Shanker, K.; Weir, David J. 1994. (1994). "The Equivalence of Four Extensions of Context-Free Grammars". Mathematical Systems Theory. 27 (6): 511–546. doi:10.1007/bf01191624. S2CID 12336597.{{cite journal}}: CS1 maint: numeric names: authors list (link)

Hayashi, Takeshi (1973). "On derivation trees of indexed grammars: An extension of the uvwxy-theorem". Publications of the Research Institute for Mathematical Sciences. 9: 61–92. doi:10.2977/prims/1195192738.

Vijay-Shanker, K.; Weir, David J. 1994. (1994). "The Equivalence of Four Extensions of Context-Free Grammars". Mathematical Systems Theory. 27 (6): 511–546. doi:10.1007/bf01191624. S2CID 12336597.{{cite journal}}: CS1 maint: numeric names: authors list (link)

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.
Alfred Aho (1969). "Nested Stack Automata". Journal of the ACM. 16 (3): 383–406. doi:10.1145/321526.321529. S2CID 685569.
Robert H. Gilman (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.
Vijay-Shanker, K.; Weir, David J. 1994. (1994). "The Equivalence of Four Extensions of Context-Free Grammars". Mathematical Systems Theory. 27 (6): 511–546. doi:10.1007/bf01191624. S2CID 12336597.{{cite journal}}: CS1 maint: numeric names: authors list (link)