关于双索引标引文法及其限制
On Finite-Index Indexed Grammars and Their Restrictions
摘要：
由线性索引文法生成的语言族L（INDLIN）在文献中已经被研究过。已知L（INDLIN）中每种语言的Parikh图像都是半线性的。然而，有界半线性语言不在L（INDLIN）中。在这里，我们将研究更大的（受限）索引语言家族，并研究它们的属性、关系和可判定性。
英文摘要：
The family, L(INDLIN), of languages generated by linear indexed grammars has been studied in the literature. It is known that the Parikh image of every language in L(INDLIN) is semi-linear. However, there are bounded semi linear languages that are not in L(INDLIN). Here, we look at larger families of (restricted) indexed languages and study their properties, their relationships, and their decidability properties.
机构、总结、中文摘要均由AI分析而来，可能存在错误，请以论文正文为准。
