On Finite-Index Indexed Grammars and Their Restrictions

Flavio D’Alessandro,Ian Mcquillan,Oscar H Ibarra

doi:10.1007/978-3-319-53733-7_21

On Finite-Index Indexed Grammars and Their Restrictions

Flavio D’Alessandro, Ian Mcquillan + Show 1 more

Open Access

https://doi.org/10.1007/978-3-319-53733-7_21

Copy DOI

Publication Date: Jan 1, 2017
Citations: 3	License type: cc-by-nc-nd

Affiliation: Sapienza University of Rome, Boğaziçi University, University of Saskatchewan, University of California, Santa Barbara

#Linear Indexed Grammars #Decidability Properties + Show 5 more

Abstract
Full-Text PDF
Similar Papers

Abstract

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

Full Text