On finite-index indexed grammars and their restrictions

Abstract The family, L ( IND LIN ) , 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 ( IND LIN ) is semi-linear. However, there are bounded semi-linear languages that are not in L ( IND LIN ) . Here, we look at larger families of (restricted) indexed languages and study their combinatorial and decidability properties, and their relationships.

[1]  Seymour Ginsburg,et al.  The mathematical theory of context free languages , 1966 .

[2]  Makoto Kanazawa,et al.  A Generalization of Linear Indexed Grammars Equivalent to Simple Context-Free Tree Grammars , 2014, FG.

[3]  Brigitte Rozoy.  The Dyck Language D'_1^* Is Not Generated by Any Matric Grammar of Finite Index , 1987, Inf. Comput..

[4]  Jean Berstel,et al.  Transductions and context-free languages , 1979, Teubner Studienbücher : Informatik.

[5]  Grzegorz Rozenberg,et al.  The mathematical theory of L systems , 1980 .

[6]  Grzegorz Rozenberg,et al.  On the Effect of the Finite Index Restriction on Several Families of Grammars , 1978, Inf. Control..

[7]  Alfred V. Aho,et al.  Indexed Grammars—An Extension of Context-Free Grammars , 1967, SWAT.

[8]  Michael A. Harrison,et al.  Introduction to formal language theory , 1978 .

[9]  Grzegorz Rozenberg,et al.  On ET0L Systems of Finite Index , 1978, Inf. Control..

[10]  Oscar H. Ibarra,et al.  Reversal-Bounded Multicounter Machines and Their Decision Problems , 1978, JACM.

[11]  Jeffrey D. Ullman,et al.  Introduction to Automata Theory, Languages and Computation , 1979 .

[12]  Brenda S. Baker,et al.  Reversal-Bounded Multipushdown Machines , 1974, J. Comput. Syst. Sci..

[13]  Georg Zetzsche,et al.  An approach to computing downward closures , 2015, ICALP.

[14]  Gheorghe Paun,et al.  Regulated Rewriting in Formal Language Theory , 1989 .

[15]  Rainer Parchmann,et al.  Linear Indexed Languages , 1984, Theor. Comput. Sci..

[16]  Oscar H. Ibarra,et al.  On Bounded Semilinear Languages, Counter Machines, and Finite-Index ET0L , 2016, CIAA.

[17]  Gerald Gazdar,et al.  Applicability of Indexed Grammars to Natural Languages , 1988 .

[18]  Oscar H. Ibarra,et al.  On Families of Full Trios Containing Counter Machine Languages , 2016, DLT.

[19]  David J. Weir,et al.  The equivalence of four extensions of context-free grammars , 1994, Mathematical systems theory.

[20]  Alfred V. Aho,et al.  Nested Stack Automata , 1969, Journal of the ACM.