@article{DALESSANDRO2021104613,
    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 combinatorial and decidability properties, and their relationships.},
    Author = {D'Alessandro, Flavio and Ibarra, Oscar H. and McQuillan, Ian},
    File = {On finite-index indexed grammars and their restrictions - 10.1016@j.ic.2020.104613 - a.pdf},
    ISSN = {0890-5401},
    Journal = {Information and Computation},
    Keywords = {Indexed languages, Finite-index, Full trios, Semi-linearity, Bounded languages, languages},
    Note = {Selected Papers of the 11th International Conference on Language and Automata Theory and Applications, LATA 2017},
    Pages = {104613},
    Title = {On finite-index indexed grammars and their restrictions},
    URL = {https://www.sciencedirect.com/science/article/pii/S0890540120301012},
    Volume = {279},
    Year = {2021},
    bdsk-url-1 = {https://www.sciencedirect.com/science/article/pii/S0890540120301012},
    bdsk-url-2 = {https://doi.org/10.1016/j.ic.2020.104613},
    date-added = {2023-01-08 20:57:34 +0100},
    date-modified = {2023-01-08 20:57:34 +0100},
    doi = {10.1016/j.ic.2020.104613}
}

@article{DALESSANDRO2021104613, 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 combinatorial and decidability properties, and their relationships.}, Author = {D'Alessandro, Flavio and Ibarra, Oscar H. and McQuillan, Ian}, File = {On finite-index indexed grammars and their restrictions - 10.1016@j.ic.2020.104613 - a.pdf}, ISSN = {0890-5401}, Journal = {Information and Computation}, Keywords = {Indexed languages, Finite-index, Full trios, Semi-linearity, Bounded languages, languages}, Note = {Selected Papers of the 11th International Conference on Language and Automata Theory and Applications, LATA 2017}, Pages = {104613}, Title = {On finite-index indexed grammars and their restrictions}, URL = {https://www.sciencedirect.com/science/article/pii/S0890540120301012}, Volume = {279}, Year = {2021}, bdsk-url-1 = {https://www.sciencedirect.com/science/article/pii/S0890540120301012}, bdsk-url-2 = {https://doi.org/10.1016/j.ic.2020.104613}, date-added = {2023-01-08 20:57:34 +0100}, date-modified = {2023-01-08 20:57:34 +0100}, doi = {10.1016/j.ic.2020.104613} }