On Finite-Index Indexed Grammars and Their Restrictions
Formal Languages and Automata Theory
2022-12-08 v4
Abstract
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.
Keywords
Cite
@article{arxiv.1610.06366,
title = {On Finite-Index Indexed Grammars and Their Restrictions},
author = {Flavio D'Alessandro and Oscar H. Ibarra and Ian McQuillan},
journal= {arXiv preprint arXiv:1610.06366},
year = {2022}
}
Comments
16 pages, latest version